Total eccentricity index of graphs with fixed number of pendant or cut vertices

DOI10.1007/s11587-022-00756-8zbMATH Open1547.05076MaRDI QIDQ6601228

Kamal L. Patra, Dinesh Pandey

Publication date: 10 September 2024

Published in: Ricerche di Matematica (Search for Journal in Brave)

zbMATH Keywords

eccentricityunicyclic graphpendant vertexcut vertextotal eccentricity index

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total eccentricity of some graph operations
• Eccentricity sums in trees
• On the extremal properties of the average eccentricity
• Wiener index of some graph operations
• Total eccentricity index of the generalized hierarchical product of graphs
• Four new sums of graphs and their Wiener indices
• Average eccentricity, minimum degree and maximum degree in graphs
• On the relation between Wiener index and eccentricity of a graph
• Some degree and distance-based invariants of wreath products of graphs
• Upper bounds on the average eccentricity
• Ordering unicyclic graphs with large average eccentricities
• Wiener index of graphs with fixed number of pendant or cut-vertices

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

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