Chinese Quarterly Journal of Mathematics ›› 2015, Vol. 30 ›› Issue (4): 620-623.doi: 10.13371/j.cnki.chin.q.j.m.2015.04.015

Previous Articles     Next Articles

On the Transitivity of the Strong Product of Graphs

  

  1. College of Computer, Qinghai Normal University
  • Received:2014-04-05 Online:2015-12-30 Published:2020-11-19
  • About author:DONG Li-xin(1982-), female, native of Handan, Hebei, a lecturer of Qinghai Normal University, M.S.D., engages in complex networks and its application.
  • Supported by:
    Supported by the National Natural Science Foundation of China(61164005,11161037,11101232,61440005,11461054); Supported by the Program for Changjiang Scholars and Innovative Research Team in Universities(IRT1068); Supported by the Research Fund for the Chunhui Program of Ministry of Education of China(Z2014022); Supported by the Nature Science Foundation from Qinghai Province(2014-ZJ-721,2014-ZJ-907,2015-ZJ-905);

Abstract: Since many large graphs are composed from some existing smaller graphs by using graph operations, say, the Cartesian product, the Lexicographic product and the Strong 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 Strong product of vertex-transitive graphs. In particular, we show that the Strong product of Cayley graphs is still a Cayley graph. 

Key words: Cayley graph, strong product, vertex-transitive graph

CLC Number: