Products of circulant graphs are metacirculant. (Q1850608): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Construction for Vertex-Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRODUCTS OF CIRCULANT GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Problem for Metacirculant Graphs of Order a Product of Distinct Primes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4860774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Operations on Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a product dimension of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the isomorphism problem for a family of cubic metacirculant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The composition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4351070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kronecker Product of Graphs / rank
 
Normal rank

Latest revision as of 18:12, 4 June 2024

scientific article
Language Label Description Also known as
English
Products of circulant graphs are metacirculant.
scientific article

    Statements

    Products of circulant graphs are metacirculant. (English)
    0 references
    10 December 2002
    0 references
    Broere and Hattingh studied \(B\)-products of graphs (introduced by Imrich and Izbicki) and proved that the lexicographic product of two circulant graphs is again circulant, but this is not the case with other products. In the present paper any \(B\)-product of two circulant graphs is proved to be a metacirculant graph with parameters that are easily described in terms of the product graphs. Moreover, any metacirculant graph is isomorphic to the \(B\)-product of a pair of circulant graphs.
    0 references
    0 references

    Identifiers