AbstractThe Wiener number is the sum of distances between all pairs of vertices of a connected graph. In this paper, we give an explicit algebraic formula for the Wiener number of a class of interchange graphs. Moreover, distance-related properties and cliques of this class of interchange graphs are investigated
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
The Wiener index of a graph G denoted by W(G) is the sum of distances between all (unordered) pairs ...
AbstractThe Wiener number is the sum of distances between all pairs of vertices of a connected graph...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance fun...
AbstractThe Wiener number, W(G), is the sum of the distances of all pairs of vertices in a graph G. ...
The Wiener number of a graph G is defined as $1/2 ∑_{u,v ∈ V(G)} d(u,v)$, d the distance function on...
The Wiener number of a graph G is dened as 12 P u;v2V (G) d(u; v), d the distance function on G. The...
The distance d(u, v|G) between the vertices u and v of a (con-nected) graph G is the length ( = numb...
AbstractThe Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of...
AbstractIn this paper, a Wiener-type graph invariant W∗ is considered, defined as the sum of the pro...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
The Wiener index of a graph G denoted by W(G) is the sum of distances between all (unordered) pairs ...
AbstractThe Wiener number is the sum of distances between all pairs of vertices of a connected graph...
AbstractThe Wiener index is the sum of distances between all vertex pairs in a connected graph. This...
The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance fun...
AbstractThe Wiener number, W(G), is the sum of the distances of all pairs of vertices in a graph G. ...
The Wiener number of a graph G is defined as $1/2 ∑_{u,v ∈ V(G)} d(u,v)$, d the distance function on...
The Wiener number of a graph G is dened as 12 P u;v2V (G) d(u; v), d the distance function on G. The...
The distance d(u, v|G) between the vertices u and v of a (con-nected) graph G is the length ( = numb...
AbstractThe Wiener number W(G) of a graph G is the sum of distances between all pairs of vertices of...
AbstractIn this paper, a Wiener-type graph invariant W∗ is considered, defined as the sum of the pro...
Abstract. The Wiener index is one of the oldest graph parameter which is used to study molecular-gra...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
AbstractThe Wiener index W(G) of a connected graph G is defined as the sum of distances between all ...
AbstractFor a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum ...
The Wiener index of a graph G denoted by W(G) is the sum of distances between all (unordered) pairs ...
DOI
Add to ORKG