A theory of Cartesian product and factorization of circulant graphs

DOI10.1155/2013/163740zbMath1295.05202OpenAlexW2169537276WikidataQ58919324 ScholiaQ58919324MaRDI QIDQ2249919

V. Vilfred

Publication date: 4 July 2014

Published in: Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/163740

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

New families of circulant graphs without Cayley isomorphism property with \(r_i = 2\) ⋮ Efficient \(k\)-distance dominating set in Cayley graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph multiplication
• Associative products of graphs
• Products of circulant graphs are metacirculant.
• On Circulant Matrices
• Circulants and their connectivities
• A Construction for Vertex-Transitive Graphs
• PRODUCTS OF CIRCULANT GRAPHS

This page was built for publication: A theory of Cartesian product and factorization of circulant graphs