On mixed almost Moore graphs of diameter two (Q281579): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
Summary: 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 \(\mathbb{Q}[x]\) of their characteristic polynomial. In this context, we deal with the irreducibility of \(\Phi_i(x^2+x-(r-1))\), where \(\Phi_i(x)\) denotes the \(i\)-th cyclotomic polynomial.
Property / review text: Summary: 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 \(\mathbb{Q}[x]\) of their characteristic polynomial. In this context, we deal with the irreducibility of \(\Phi_i(x^2+x-(r-1))\), where \(\Phi_i(x)\) denotes the \(i\)-th cyclotomic polynomial. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6579078 / rank
 
Normal rank
Property / zbMATH Keywords
 
degree/diameter problem
Property / zbMATH Keywords: degree/diameter problem / rank
 
Normal rank
Property / zbMATH Keywords
 
mixed almost Moore graph
Property / zbMATH Keywords: mixed almost Moore graph / rank
 
Normal rank
Property / zbMATH Keywords
 
characteristic polynomial
Property / zbMATH Keywords: characteristic polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
cyclotomic polynomial
Property / zbMATH Keywords: cyclotomic polynomial / rank
 
Normal rank
Property / zbMATH Keywords
 
permutation cycle structure
Property / zbMATH Keywords: permutation cycle structure / rank
 
Normal rank

Revision as of 17:41, 27 June 2023

scientific article
Language Label Description Also known as
English
On mixed almost Moore graphs of diameter two
scientific article

    Statements

    On mixed almost Moore graphs of diameter two (English)
    0 references
    0 references
    0 references
    11 May 2016
    0 references
    Summary: 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 \(\mathbb{Q}[x]\) of their characteristic polynomial. In this context, we deal with the irreducibility of \(\Phi_i(x^2+x-(r-1))\), where \(\Phi_i(x)\) denotes the \(i\)-th cyclotomic polynomial.
    0 references
    degree/diameter problem
    0 references
    mixed almost Moore graph
    0 references
    characteristic polynomial
    0 references
    cyclotomic polynomial
    0 references
    permutation cycle structure
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references