Products of Circulant Graphs Are Metacirculant
Copyright policy )Products of Circulant Graphs Are Metacirculant
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.
- State University of New York United States
- Buffalo State College United States
Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science
Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Graphs and abstract algebra (groups, rings, fields, etc.), Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).4 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!