In this paper, by using the degree sequences of graphs, we present sufficient conditions for a graph to be Hamiltonian, traceable, Hamilton-connected or $k$-connected in light of numerous topological indices such as the eccentric connectivity index, the eccentric distance sum, the connective eccentricity index
A graph G is Hamiltonian-connected if every two vertices of G are connected by a Hamilton path. A bi...
Let $G=(V,E)$ be a simple connected graph with the vertex set $V$and the edge set $E$. The Wiener-ty...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
summary:During the last decade, several research groups have published results on sufficient conditi...
AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the ham...
AbstractIn 1980, Bondy proved that for an integer k≥2 a (k+s)-connected graph of order n≥3 is tracea...
AbstractFor a simple graph G, let NCD(G)=min{|N(u)∪N(v)|+d(w):u,v,w∈V(G),uv⁄∈E(G),wvorwu⁄∈E(G)}. In ...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
Please read abstract in the article.The University of South Africa and the National Research Foundat...
For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where d...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamilt...
Let G be a graph. A Hamilton path in G is a path containing every vertex of G. The graph G is trace...
A graph G is Hamiltonian-connected if every two vertices of G are connected by a Hamilton path. A bi...
Let $G=(V,E)$ be a simple connected graph with the vertex set $V$and the edge set $E$. The Wiener-ty...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
summary:During the last decade, several research groups have published results on sufficient conditi...
AbstractAn extension of a theorem of Chartrand and Wall is obtained and, with it, a bound on the ham...
AbstractIn 1980, Bondy proved that for an integer k≥2 a (k+s)-connected graph of order n≥3 is tracea...
AbstractFor a simple graph G, let NCD(G)=min{|N(u)∪N(v)|+d(w):u,v,w∈V(G),uv⁄∈E(G),wvorwu⁄∈E(G)}. In ...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
Please read abstract in the article.The University of South Africa and the National Research Foundat...
For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where d...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamilt...
Let G be a graph. A Hamilton path in G is a path containing every vertex of G. The graph G is trace...
A graph G is Hamiltonian-connected if every two vertices of G are connected by a Hamilton path. A bi...
Let $G=(V,E)$ be a simple connected graph with the vertex set $V$and the edge set $E$. The Wiener-ty...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...