The Necessary and Sufficient Condition of a Graph G is Automorphism Line Graph
Sheng Ji-ming
Abstract
Sheng Ji-ming
Abstract
The definition of atuomorphism line graph is given the first in this paper.It is proved that a simple graph G is automorphism line graph if and only if the graph G is 2-regular graph.
A significance statement is not available in the OpenAlex record.
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.
The definition of atuomorphism line graph is given the first in this paper.It is proved that a simple graph G is automorphism line graph if and only if the graph G is 2-regular graph.
Key concepts: Line graph, Mathematics, Edge-transitive graph, Voltage graph, Combinatorics, Vertex-transitive graph, Graph automorphism, Complement graph