A theory of Cartesian product and factorization of circulant graphs
From MaRDI portal
Publication:2249919
DOI10.1155/2013/163740zbMath1295.05202WikidataQ58919324 ScholiaQ58919324MaRDI QIDQ2249919
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
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C76: Graph operations (line graphs, products, etc.)
Related Items
Efficient \(k\)-distance dominating set in Cayley graphs, New families of circulant graphs without Cayley isomorphism property with \(r_i = 2\)
Cites Work