Wiener index of graphs with fixed number of pendant or cut-vertices

DOI10.21136/CMJ.2022.0515-20MaRDI QIDQ5084252

Dinesh Pandey, Kamal Lochan Patra

Publication date: 23 June 2022

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

distanceWiener indexunicyclic graphpendant vertexcut-vertex

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cites Work

• Wiener index of Eulerian graphs
• The extremal values of the Wiener index of a tree with given degree sequence
• Wiener index of graphs with more than one cut-vertex
• Mean distance in a graph
• Average distances in undirected graphs and the removal of vertices
• Average distance and independence number
• On the sum of all distances in composite graphs
• The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices
• The minimum Wiener index of unicyclic graphs with a fixed diameter
• Mean distance in a tree
• Superdominance order and distance of trees with bounded maximum degree
• On the sum of all distances in a graph or digraph
• Distance in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Wiener index of graphs with fixed number of pendant or cut-vertices