The Steiner k-Wiener index of graphs with given minimum degree

DOI10.1016/J.DAM.2019.05.015zbMATH Open1419.05060arXiv1805.04571OpenAlexW2964293255MaRDI QIDQ2274075FDOQ2274075

Authors: Peter Dankelmann 

Publication date: 19 September 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Let $G$ be a connected graph. The Steiner distance $d(S)$ of a set $S$ of vertices is the minimum size of a connected subgraph of $G$ containing all vertices of $S$. For $kinmathbbN$, the Steiner $k$-Wiener index $S{W}_k(G)$ is defined as $su{m}_{S}d(S)$, where the sum is over all $k$-element subsets of the vertex set of $G$. The average Steiner $k$-distance $m{u}_k(G)$ of $G$ is defined as $$. In this paper we prove upper bounds on the Steiner Wiener index and the average Steiner distance of graphs with given order $n$ and minimum degree $delta$. Specifically we show that $$, and that $m{u}_k(G)leqfrack-1k+1frac3ndelta+1+O(1)$. We improve this bound for triangle-free graphs to $$, and $m{u}_k(G)leqfrack-1k+1frac2ndelta+O(1)$. All bounds are best possible.

Full work available at URL: https://arxiv.org/abs/1805.04571

Recommendations

• The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
• The Steiner Wiener index of a graph
• Steiner Wiener index and connectivity of graphs
• Bounds on the Steiner-Wiener index of graphs
• Inverse problem on the Steiner Wiener index

zbMATH Keywords

Steiner distanceWiener indextransmissionaverage distanceSteiner Wiener indexaverage Steiner distance

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Title not available (Why is that?)
• On the sum of all distances in composite graphs
• On the average Steiner distance of graphs with presribed properties
• Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
• The Steiner Wiener index of a graph
• Distance in graphs
• Steiner distance in graphs
• Upper bounds on the Steiner diameter of a graph
• The average Steiner distance of a graph
• On Wiener index of common neighborhood graphs
• Topology in chemistry. Discrete mathematics in molecules.
• On the sum of all distances in a graph or digraph
• Title not available (Why is that?)
• Wiener index of trees of given order and diameter at most 6
• A class of trees and its Wiener index
• Molecular graphs and the inverse Wiener index problem
• Title not available (Why is that?)
• Mean distance in a graph
• Average distance, minimum degree, and spanning trees
• Mean distance and minimum degree
• Using minimum degree to bound average distance
• The Steiner diameter of a graph with prescribed girth
• All but 49 numbers are Wiener indices of trees
• Steiner diameter of 3, 4 and 5-connected maximal planar graphs
• Nordhaus-Gaddum-type results for the Steiner Wiener index of graphs
• Steiner Wiener index of graph products
• Average distance and vertex-connectivity
• Mathematical aspects of Wiener index
• Inverse problem on the Steiner Wiener index
• On maximum Wiener index of trees and graphs with given radius
• Average Distance and Edge-Connectivity II
• Average Distance and Edge-Connectivity I
• A sharp lower bound on Steiner Wiener index for trees with given diameter

Cited In (8)

• A note on the Steiner \(k\)-radius and Steiner \(k\)-diameter
• Steiner diameter, maximum degree and size of a graph
• Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
• The edge-Wiener index of zigzag nanotubes
• Bounds on the Steiner-Wiener index of graphs
• The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
• Steiner Wiener index and connectivity of graphs
• Minimum Wiener index of triangulations and quadrangulations

Uses Software

• GRAFFITI

This page was built for publication: The Steiner \(k\)-Wiener index of graphs with given minimum degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274075)