An upper bound on Wiener indices of maximal planar graphs
From MaRDI portal
(Redirected from Publication:1732098)
Recommendations
Cites work
- Average Distance and Edge-Connectivity I
- Average Distance and Edge-Connectivity II
- Average distance and vertex-connectivity
- Distance in graphs
- Edge-vulnerability and mean distance
- Generation of Triangulations of the Sphere
- Graph connectivity and Wiener index
- scientific article; zbMATH DE number 4031733 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 90560 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Mean distance in a graph
- On the connectivity of maximal planar graphs
- On the sum of all distances in a graph or digraph
Cited in
(13)- \(k\)-Wiener index of a \(k\)-plex
- Minimum Wiener index of triangulations and quadrangulations
- The upper bounds on the Steiner \(k\)-Wiener index in terms of minimum and maximum degrees
- The edge-Wiener index of zigzag nanotubes
- Wiener indices of maximal \(k\)-degenerate graphs
- An Information-Theoretic Upper Bound on Planar Graphs Using Well-Orderly Maps
- Wiener Index and Remoteness in Triangulations and Quadrangulations
- Proximity in triangulations and quadrangulations
- \((k+1)\)-line graphs of \(k\)-trees
- Computing the number and average size of connected sets in planar 3-trees
- The maximum Wiener index of a uniform hypergraph
- On proximity and other distance parameters in planar graphs
- The maximum Wiener index of maximal planar graphs
This page was built for publication: An upper bound on Wiener indices of maximal planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732098)