Products of circulant graphs are metacirculant.
From MaRDI portal
Publication:1850608
DOI10.1006/jctb.2001.2095zbMath1035.05050OpenAlexW1979942135MaRDI QIDQ1850608
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a659dc3d4ba5845e090ff370b96baf794cff58ea
Related Items (3)
Some results on the lexicographic product of vertex-transitive graphs ⋮ A theory of Cartesian product and factorization of circulant graphs ⋮ Petersen type \(n\)-circulant and weak metacirculant
Cites Work
- The composition of graphs
- On a product dimension of graphs
- Associative products of graphs
- On the isomorphism problem for a family of cubic metacirculant graphs
- The Kronecker Product of Graphs
- A Construction for Vertex-Transitive Graphs
- Isomorphism Problem for Metacirculant Graphs of Order a Product of Distinct Primes
- PRODUCTS OF CIRCULANT GRAPHS
- Boolean Operations on Graphs.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Products of circulant graphs are metacirculant.