Wiener index and Steiner 3-Wiener index of graphs
From MaRDI portal
(Redirected from Wiener index and Steiner 3-Wiener index of graphs)
Abstract: Let be a set of vertices of a connected graph . The Steiner distance of is the minimum size of a connected subgraph of containing all the vertices of . The sum of all Steiner distances on sets of size is called the Steiner -Wiener index, hence for we get the Wiener index. The modular graphs are graphs in which every three vertices and have at least one median vertex that belongs to shortest paths between each pair of and . The Steiner 3-Wiener index of a modular graph is expressed in terms of its Wiener index. As a corollary formulae for the Steiner 3-Wiener index of Fibonacci and Lucas cubes are obtained.
Recommendations
- The Steiner Wiener index of a graph
- On the Steiner hyper-Wiener index of a graph
- Steiner Wiener index and connectivity of graphs
- Steiner Wiener index of line graphs
- Steiner Wiener index of the square of graphs
- Bounds on the Steiner-Wiener index of graphs
- The Wiener index of a class of tricyclic graphs
- On the Wiener index of graphs
- Steiner Wiener index of graph products
- Steiner Wiener index of block graphs
Cites work
- A characterization of block graphs
- Absolute retracts of bipartite graphs
- Fibonacci and Lucas Numbers With Applications
- Inverse of the distance matrix of a block graph
- On the sum of all distances in composite graphs
- Steiner centers and Steiner medians of graphs
- Steiner distance in graphs
- Steiner intervals in graphs
- Steiner Wiener index of block graphs
- Steiner Wiener index of graph products
- Structure of Fibonacci cubes: a survey
- The average Steiner distance of a graph
- The Steiner Wiener index of a graph
- Wiener index and Hosoya polynomial of Fibonacci and Lucas cubes
Cited in
(5)
This page was built for publication: Wiener index and Steiner 3-Wiener index of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013455)