Graph operations on Cayley graphs of semigroups
Amir Assari, Narges Hosseinzadeh
Abstract
Open-access reader
Amir Assari, Narges Hosseinzadeh
Abstract
Open-access reader
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.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Vertex-transitive graph, Mathematics, Cayley graph, Combinatorics, Symmetric graph, Graph product, Cograph, Discrete mathematics