Liu Rui-fu
Abstract
Let G be a simple graph with vertex set V(G) and edge set E(G).L(G)is the line graph of G,if a graph G satisfies κ(G)≥α(G) or dia(G)≤2 then its line graph L(G) is Hamiltonian respectively.Under the same condition,we consider the components of 2-factors in this paper.
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.
Let G be a simple graph with vertex set V(G) and edge set E(G).L(G)is the line graph of G,if a graph G satisfies κ(G)≥α(G) or dia(G)≤2 then its line graph L(G) is Hamiltonian respectively.Under the same condition,we consider the components of 2-factors in this paper.
Key concepts: Combinatorics, Line graph, Graph, Bound graph, Mathematics, Complement graph, Vertex (graph theory), Graph power