summary:The Wiener index of a connected graph is defined as the sum of the distances between all unordered pairs of its vertices. We characterize the graphs which extremize the Wiener index among all graphs on $n$ vertices with $k$ pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on $n$ vertices with $s$ cut-vertices
: In this article, we have examined the Wiener index in neutrosophic graphs. Wiener index is one of ...
In 1947 and 1948, Harry Wiener published five papers which introduced a pair of graph theoretical in...
In 1947 and 1948, Harry Wiener published five papers which introduced a pair of graph theoretical in...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
Abstract The Wiener index of a connected graph is defined as the sum of distances between all pairs ...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
AbstractThe kth power of a graph G, denoted by Gk, is a graph with the same vertex set as G such tha...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
Let G be a graph. The Wiener index of G is defined as W(G) = 1/2∑{x,y}⊆V(G)d(x,y), where V(G) is th...
AbstractThe Wiener number, W(G), is the sum of the distances of all pairs of vertices in a graph G. ...
AbstractWe study distance-based graph invariants, such as the Wiener index, the Szeged index, and va...
: In this article, we have examined the Wiener index in neutrosophic graphs. Wiener index is one of ...
In 1947 and 1948, Harry Wiener published five papers which introduced a pair of graph theoretical in...
In 1947 and 1948, Harry Wiener published five papers which introduced a pair of graph theoretical in...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
Abstract The Wiener index of a connected graph is defined as the sum of distances between all pairs ...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
The Wiener index W(G) of a connected graph G, introduced by Wiener in 1947, is defined as W(G) = ∑u,...
AbstractThe Wiener index of a graph is the sum of all pairwise distances of vertices of the graph. I...
AbstractThe kth power of a graph G, denoted by Gk, is a graph with the same vertex set as G such tha...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
Let G be a graph. The Wiener index of G is defined as W(G) = 1/2∑{x,y}⊆V(G)d(x,y), where V(G) is th...
AbstractThe Wiener number, W(G), is the sum of the distances of all pairs of vertices in a graph G. ...
AbstractWe study distance-based graph invariants, such as the Wiener index, the Szeged index, and va...
: In this article, we have examined the Wiener index in neutrosophic graphs. Wiener index is one of ...
In 1947 and 1948, Harry Wiener published five papers which introduced a pair of graph theoretical in...
In 1947 and 1948, Harry Wiener published five papers which introduced a pair of graph theoretical in...
DOI
Add to ORKG