The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. The additively weighted Harary index H A ( G ) is a modification of the Harary index in which the contributions of vertex pairs are weighted by the sum of their degrees. This new invariant was introduced in (Alizadeh, Iranmanesh and Došlić. Additively weighted Harary index of some composite graphs, Discrete Math, 2013) and they posed the following question: What is the behavior of H A ( G ) when G is a composite graph resulting for example by: splice, link, corona and rooted product? We investigate the additively weighted Harary index for these standard graph products. Then we obtain lower and upper ...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
In this paper, we present the various upper and lower boundsfor the product version of reciprocal de...
The reformulated reciprocal degree distance is defined for a connected graph G as R¯t(G)=(1/2)∑u,υ∈V...
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of ...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
This is the first book to focus on the topological index, the Harary index, of a graph, including it...
Abstract. The Narumi-Katayama index of a graph G, denoted by N K(G), is equal to the product of degr...
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 ...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
The k-th power of a graph G, denoted by Gk, is a graph with the same set of vertices as G, such that...
For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where d...
In this paper, we study the behavior of a new graph invariants ρ for some composite graphs such as s...
Abstract. Introduced in 1947, theWiener indexW(T) = {u,v}⊆V(T) d(u, v) is one of themost thoroughly ...
AbstractThe Szeged index Sz is a recently introduced graph invariant, having applications in chemist...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
In this paper, we present the various upper and lower boundsfor the product version of reciprocal de...
The reformulated reciprocal degree distance is defined for a connected graph G as R¯t(G)=(1/2)∑u,υ∈V...
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of ...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
This is the first book to focus on the topological index, the Harary index, of a graph, including it...
Abstract. The Narumi-Katayama index of a graph G, denoted by N K(G), is equal to the product of degr...
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 ...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
The k-th power of a graph G, denoted by Gk, is a graph with the same set of vertices as G, such that...
For a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v), where d...
In this paper, we study the behavior of a new graph invariants ρ for some composite graphs such as s...
Abstract. Introduced in 1947, theWiener indexW(T) = {u,v}⊆V(T) d(u, v) is one of themost thoroughly ...
AbstractThe Szeged index Sz is a recently introduced graph invariant, having applications in chemist...
AbstractThe Harary index is defined as the sum of reciprocals of distances between all pairs of vert...
In this paper, we present the various upper and lower boundsfor the product version of reciprocal de...
The reformulated reciprocal degree distance is defined for a connected graph G as R¯t(G)=(1/2)∑u,υ∈V...