Graph operations on Cayley graphs of semigroups

Authors

  • Amir Assari Jondi-Shapur university of thechnology
  • Narges Hosseinzadeh Islamic Azad University,Dezful branch, Iran

DOI:

https://doi.org/10.14419/ijamr.v3i1.1712

Published:

2014-02-07

Abstract

Lots of  large graphs can be constructed from existing smaller graphs by using graph operations, such as  the  graph products. Many properties of such large graphs are closely related to those of the corresponding smaller ones.In this paper we consider some operations of Cayley graphs on semigroups.

 

Keywords: Graph operation, Cyaley graph, Col-Aut-vertex transitive.

References

A. Assari and N. Hoseinzadeh. Tensor product of colour vertex transitive Cayley graphs of finite semigroups,Gen. Math. Notes, Vol. 19, No. 1, November, 2013, pp. 28-34.

A. Gardiner, C. E. Praeger, On 4-valent symmetric graphs, European J. Combin., 1994, 15: 375-381.

A. Gardiner, C. E. Praeger, A characterization of certain families of 4-valent symmetric graphs, European J. Combin., 1994, 15: 383397.

M. V. Lawson, Inverse semigroups: the theory of partial symmetries, World Scientific Publishing Co., Inc., NJ, 1998.

A. V. Kelarev and C. E. Praeger, On transitive Cayley graphs of groups and semigroups, European J. of Com. No.24 (2003) 59-72.

S. Spacapan, Connectivity of Cartesian product of graphs, Applied Mathematica Letters Vol. 21, Issue 7, 2008, 682-685.

F. Li , W. Wang, Z. Xu, H. Zhao. Some results on the lexicographic product of vertex-transitive graphs, Applied Math. Letters, 2011,24, 1924-1926.

View Full Article: