On mixed almost Moore graphs of diameter two

Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extremal mixed graphs, in the sense that their order is one less than the Moore bound for mixed graphs. The problem of their existence has been considered before for directed graphs and undirected ones, but...

ver descrição completa

Detalhes bibliográficos
Autores: López Lorenzo, Ignacio, Miret, Josep M. (Josep Maria)
Tipo de documento: artigo
Estado:Versão publicada
Data de publicação:2016
País:España
Recursos:Universitat de Lleida (UdL)
Repositório:Repositori Obert UdL
OAI Identifier:oai:repositori.udl.cat:10459.1/56843
Acesso em linha:http://hdl.handle.net/10459.1/56843
Access Level:Acceso aberto
Palavra-chave:Degree/Diameter problem
Mixed almost Moore graph
Characteristic polynomial
Cyclotomic polynomial
Permutation cycle structure
Teoria de grafs
Grafs, Teoria de
id ES_f78d4bbcb9d3dca389627d62e1e52c00
oai_identifier_str oai:repositori.udl.cat:10459.1/56843
network_acronym_str ES
network_name_str España
repository_id_str
spelling On mixed almost Moore graphs of diameter twoLópez Lorenzo, IgnacioMiret, Josep M. (Josep Maria)Degree/Diameter problemMixed almost Moore graphCharacteristic polynomialCyclotomic polynomialPermutation cycle structureTeoria de grafsGrafs, Teoria deMixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extremal mixed graphs, in the sense that their order is one less than the Moore bound for mixed graphs. The problem of their existence has been considered before for directed graphs and undirected ones, but not for the mixed case, which is a kind of generalization. In this paper we give some necessary conditions for the existence of mixed almost Moore graphs of diameter two derived from the factorization in Q[x] of their characteristic polynomial. In this context, we deal with the irreducibility of Φi(x2+x−(r−1)), where Φi(x) denotes the i-th cyclotomic polynomial.Electronic Journal of Combinatorics2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/10459.1/56843reponame:Repositori Obert UdL instname:Universitat de Lleida (UdL)InglésReproducció del document publicat a http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p3Electronic Journal of Combinatorics, 2016, vol. 23, num. 2, p. 1-14(c) López et al., 2016info:eu-repo/semantics/openAccessoai:repositori.udl.cat:10459.1/568432026-06-24T12:42:17Z
dc.title.none.fl_str_mv On mixed almost Moore graphs of diameter two
title On mixed almost Moore graphs of diameter two
spellingShingle On mixed almost Moore graphs of diameter two
López Lorenzo, Ignacio
Degree/Diameter problem
Mixed almost Moore graph
Characteristic polynomial
Cyclotomic polynomial
Permutation cycle structure
Teoria de grafs
Grafs, Teoria de
title_short On mixed almost Moore graphs of diameter two
title_full On mixed almost Moore graphs of diameter two
title_fullStr On mixed almost Moore graphs of diameter two
title_full_unstemmed On mixed almost Moore graphs of diameter two
title_sort On mixed almost Moore graphs of diameter two
dc.creator.none.fl_str_mv López Lorenzo, Ignacio
Miret, Josep M. (Josep Maria)
author López Lorenzo, Ignacio
author_facet López Lorenzo, Ignacio
Miret, Josep M. (Josep Maria)
author_role author
author2 Miret, Josep M. (Josep Maria)
author2_role author
dc.subject.none.fl_str_mv Degree/Diameter problem
Mixed almost Moore graph
Characteristic polynomial
Cyclotomic polynomial
Permutation cycle structure
Teoria de grafs
Grafs, Teoria de
topic Degree/Diameter problem
Mixed almost Moore graph
Characteristic polynomial
Cyclotomic polynomial
Permutation cycle structure
Teoria de grafs
Grafs, Teoria de
description Mixed almost Moore graphs appear in the context of the Degree/Diameter problem as a class of extremal mixed graphs, in the sense that their order is one less than the Moore bound for mixed graphs. The problem of their existence has been considered before for directed graphs and undirected ones, but not for the mixed case, which is a kind of generalization. In this paper we give some necessary conditions for the existence of mixed almost Moore graphs of diameter two derived from the factorization in Q[x] of their characteristic polynomial. In this context, we deal with the irreducibility of Φi(x2+x−(r−1)), where Φi(x) denotes the i-th cyclotomic polynomial.
publishDate 2016
dc.date.none.fl_str_mv 2016
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10459.1/56843
url http://hdl.handle.net/10459.1/56843
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Reproducció del document publicat a http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p3
Electronic Journal of Combinatorics, 2016, vol. 23, num. 2, p. 1-14
dc.rights.none.fl_str_mv (c) López et al., 2016
info:eu-repo/semantics/openAccess
rights_invalid_str_mv (c) López et al., 2016
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Electronic Journal of Combinatorics
publisher.none.fl_str_mv Electronic Journal of Combinatorics
dc.source.none.fl_str_mv reponame:Repositori Obert UdL
instname:Universitat de Lleida (UdL)
instname_str Universitat de Lleida (UdL)
reponame_str Repositori Obert UdL
collection Repositori Obert UdL
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869424893303455744
score 15,812429

Registros relacionados