dc.contributor.author
López Lorenzo, Ignacio
dc.contributor.author
Miret, Josep M. (Josep Maria)
dc.date.accessioned
2024-12-05T21:54:17Z
dc.date.available
2024-12-05T21:54:17Z
dc.date.issued
2016-04-15T11:32:54Z
dc.date.issued
2016-04-15T11:32:54Z
dc.date.issued
2016-04-01
dc.date.issued
2016-04-15T11:22:39Z
dc.identifier
http://hdl.handle.net/10459.1/56843
dc.identifier.uri
http://hdl.handle.net/10459.1/56843
dc.description.abstract
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.
dc.format
application/pdf
dc.publisher
Electronic Journal of Combinatorics
dc.relation
Reproducció del document publicat a http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p3
dc.relation
Electronic Journal of Combinatorics, 2016, vol. 23, num. 2, p. 1-14
dc.rights
(c) López et al., 2016
dc.rights
info:eu-repo/semantics/openAccess
dc.subject
Degree/Diameter problem
dc.subject
Mixed almost Moore graph
dc.subject
Characteristic polynomial
dc.subject
Cyclotomic polynomial
dc.subject
Permutation cycle structure
dc.subject
Teoria de grafs
dc.subject
Grafs, Teoria de
dc.title
On mixed almost Moore graphs of diameter two
