Minimum Wiener index of triangulations and quadrangulations
From MaRDI portal
Publication:2081497
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Connectivity (05C40) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Abstract: The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations and quadrangulations with connectivity at least , and provide the extremal structures, which attain those values. Our main tool is setting upper bounds for the maximum degree in highly connected triangulations and quadrangulations.
Recommendations
- Wiener Index and Remoteness in Triangulations and Quadrangulations
- Wiener index of quadrangulation graphs
- Minimum on Wiener indices of trees and unicyclic graphs of the given matching number
- Computing the Wiener index of graphs on triples
- Minimum number of partial triangulations
- The Wiener index of a class of tricyclic graphs
- The minimum Wiener index of unicyclic graphs with a fixed diameter
- Wiener index in graphs with given minimum degree and maximum degree
- The Steiner \(k\)-Wiener index of graphs with given minimum degree
- An improved lower bound on the minimum number of triangulations
Cites work
Cited in
(4)
This page was built for publication: Minimum Wiener index of triangulations and quadrangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081497)