For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where dG(u,v) is the distance between vertices u and v. Hua and Wang (2013), using Harary index, obtained a sufficient condition for the traceable graphs. In this note, we use Harary index to present sufficient conditions for Hamiltonian and Hamilton-connected graphs
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the...
The Resistance-Harary index of a connected graph G is defined as R H ( G ) = ∑ { u ,...
AbstractLet G be an undirected and loopless finite graph that is not a path. The smallest integer m ...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
This is the first book to focus on the topological index, the Harary index, of a graph, including it...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
summary:During the last decade, several research groups have published results on sufficient conditi...
Let G be a connected graph with vertex set V(G). The Harary index of a graph is defined as H(G) = ∑u...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
In chemical graph theory, distance-degree-based topological indices are expressions of the form u =v...
Abstract. Introduced in 1947, theWiener indexW(T) = {u,v}⊆V(T) d(u, v) is one of themost thoroughly ...
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of ...
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of ...
The Harary index of G is the sum of reciprocals of distance between any two vertices in G. In this p...
The k-th power of a graph G, denoted by Gk, is a graph with the same set of vertices as G, such that...
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the...
The Resistance-Harary index of a connected graph G is defined as R H ( G ) = ∑ { u ,...
AbstractLet G be an undirected and loopless finite graph that is not a path. The smallest integer m ...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
This is the first book to focus on the topological index, the Harary index, of a graph, including it...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
summary:During the last decade, several research groups have published results on sufficient conditi...
Let G be a connected graph with vertex set V(G). The Harary index of a graph is defined as H(G) = ∑u...
AbstractLet G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and ...
In chemical graph theory, distance-degree-based topological indices are expressions of the form u =v...
Abstract. Introduced in 1947, theWiener indexW(T) = {u,v}⊆V(T) d(u, v) is one of themost thoroughly ...
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of ...
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of ...
The Harary index of G is the sum of reciprocals of distance between any two vertices in G. In this p...
The k-th power of a graph G, denoted by Gk, is a graph with the same set of vertices as G, such that...
Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the...
The Resistance-Harary index of a connected graph G is defined as R H ( G ) = ∑ { u ,...
AbstractLet G be an undirected and loopless finite graph that is not a path. The smallest integer m ...
DOI
Add to ORKG