On the extremal connective eccentricity index among trees with maximum degree

DOI10.22108/toc.2021.120679.1693zbMath1488.05095OpenAlexW3169992135MaRDI QIDQ4958100

Fazal Hayat

Publication date: 6 September 2021

Full work available at URL: https://doaj.org/article/8f195cabcaff411a84b23b5b830c5116

zbMATH Keywords

treeperfect matchingmaximum degreeconnective eccentricity index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• On the connective eccentricity index of trees and unicyclic graphs with given diameter
• On the extremal total reciprocal edge-eccentricity of trees
• Some extremal results on the connective eccentricity index of graphs
• On the eccentric connectivity index of a graph
• On the minimal eccentric connectivity indices of graphs
• On the extremal graphs with respect to the total reciprocal edge-eccentricity
• On the maximal connective eccentricity index of bipartite graphs with some given parameters
• On eccentric connectivity index
• On the maximum connective eccentricity index among k-connected graphs
• Eccentric Connectivity Index of Chemical Trees
• The extremal values of connective eccentricity index for trees and unicyclic graphs

This page was built for publication: On the extremal connective eccentricity index among trees with maximum degree