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.
English
Degree/Diameter problem; Mixed almost Moore graph; Characteristic polynomial; Cyclotomic polynomial; Permutation cycle structure; Teoria de grafs; Grafs, Teoria de
Electronic Journal of Combinatorics
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
(c) López et al., 2016
Documents de recerca [17848]