AbstractThe average n-distance of a connected graph G, μn(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on μn for two-connected graphs and for k-chromatic graphs. Moreover, we show that μn(G) does not depend on the n-diameter of G
For a non- empty set W of vertices in a connected graph G, the steiner distance d(W) of W is the min...
In 1994, Dobrynin and Kochetova introduced the concept of degree distance DD(Γ) of a connected graph...
In this article we define Steiner and upper Steiner distances in connected fuzzy graphs by combining...
AbstractThe average n-distance of a connected graph G, μn(G), is the average of the Steiner distance...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the\emph{Steiner distance} $d...
AbstractLet G be a connected graph and S a set of vertices of G. The Steiner distance of S is the sm...
AbstractBrendan McKay gave the following formula relating the average distance between pairs of vert...
Brendan McKay gave the following formula relating the average distance between pairs of vertices in ...
AbstractThe average or mean of the distances between vertices in a connected graph Γ, μ(Γ), is a nat...
AbstractLet S be a nonempty set of vertices of a connected graph G. Then the Steiner distance of S i...
AbstractLet k be a positive integer and G be a simple connected graph with order n. The average dist...
AbstractWe consider the following generalisation of the average distance of a graph. Let G be a conn...
AbstractLet G be a connected graph and S⊆V(G). Then the Steiner distance of S, denoted by dG(S), is ...
AbstractLet G be a connected graph and S a nonempty set of vertices of G. Then the Steiner distance ...
For a non- empty set W of vertices in a connected graph G, the steiner distance d(W) of W is the min...
In 1994, Dobrynin and Kochetova introduced the concept of degree distance DD(Γ) of a connected graph...
In this article we define Steiner and upper Steiner distances in connected fuzzy graphs by combining...
AbstractThe average n-distance of a connected graph G, μn(G), is the average of the Steiner distance...
AbstractLet G be a connected graph of order p and S a nonempty set of vertices of G. Then the Steine...
For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the\emph{Steiner distance} $d...
AbstractLet G be a connected graph and S a set of vertices of G. The Steiner distance of S is the sm...
AbstractBrendan McKay gave the following formula relating the average distance between pairs of vert...
Brendan McKay gave the following formula relating the average distance between pairs of vertices in ...
AbstractThe average or mean of the distances between vertices in a connected graph Γ, μ(Γ), is a nat...
AbstractLet S be a nonempty set of vertices of a connected graph G. Then the Steiner distance of S i...
AbstractLet k be a positive integer and G be a simple connected graph with order n. The average dist...
AbstractWe consider the following generalisation of the average distance of a graph. Let G be a conn...
AbstractLet G be a connected graph and S⊆V(G). Then the Steiner distance of S, denoted by dG(S), is ...
AbstractLet G be a connected graph and S a nonempty set of vertices of G. Then the Steiner distance ...
For a non- empty set W of vertices in a connected graph G, the steiner distance d(W) of W is the min...
In 1994, Dobrynin and Kochetova introduced the concept of degree distance DD(Γ) of a connected graph...
In this article we define Steiner and upper Steiner distances in connected fuzzy graphs by combining...
DOI
Add to ORKG