A theory of Cartesian product and factorization of circulant graphs (Q2249919): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4221210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRODUCTS OF CIRCULANT GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Construction for Vertex-Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulants and their connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Circulant Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of circulant graphs are metacirculant. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4290781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank

Latest revision as of 17:00, 8 July 2024

scientific article
Language Label Description Also known as
English
A theory of Cartesian product and factorization of circulant graphs
scientific article

    Statements

    A theory of Cartesian product and factorization of circulant graphs (English)
    0 references
    0 references
    4 July 2014
    0 references
    Summary: We determine when the Cartesian product of two circulant graphs is also a circulant graph. This leads to a theory of factorization of circulant graphs.
    0 references

    Identifiers