2008College MathematicsRequires access

The Necessary and Sufficient Condition of a Graph G is Automorphism Line Graph

Sheng Ji-ming

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Line graph, Mathematics, Edge-transitive graph, Voltage graph, Combinatorics, Vertex-transitive graph, Graph automorphism, Complement graph

Related papers

Back to paper searchBrowse research topicsOriginal source
The Necessary and Sufficient Condition of a Graph G is Automorphism Line Graph — Research Paper | ScholarLens