TY - JOUR
T1 - Some results on the lexicographic product of vertex-transitive graphs
AU - Li, Feng
AU - Wang, Wei
AU - Xu, Zongben
AU - Zhao, Haixing
PY - 2011/11
Y1 - 2011/11
N2 - Many large graphs can be constructed from existing smaller graphs by using graph operations, for example, the Cartesian product and the lexicographic product. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this short note, we give some properties of the lexicographic products of vertex-transitive and of edge-transitive graphs. In particular, we show that the lexicographic product of Cayley graphs is a Cayley graph.
AB - Many large graphs can be constructed from existing smaller graphs by using graph operations, for example, the Cartesian product and the lexicographic product. Many properties of such large graphs are closely related to those of the corresponding smaller ones. In this short note, we give some properties of the lexicographic products of vertex-transitive and of edge-transitive graphs. In particular, we show that the lexicographic product of Cayley graphs is a Cayley graph.
KW - Cayley graph
KW - Lexicographic product
KW - Vertex-transitive graph
UR - https://www.scopus.com/pages/publications/79959776258
U2 - 10.1016/j.aml.2011.05.021
DO - 10.1016/j.aml.2011.05.021
M3 - 文章
AN - SCOPUS:79959776258
SN - 0893-9659
VL - 24
SP - 1924
EP - 1926
JO - Applied Mathematics Letters
JF - Applied Mathematics Letters
IS - 11
ER -