On the maximum connective eccentricity index among k-connected graphs

DOI10.1142/S1793830921500026zbMath1475.05038OpenAlexW3047414172MaRDI QIDQ5012794

Fazal Hayat

Publication date: 25 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500026

zbMATH Keywords

diameterindependence numberconnectivityminimum degreeCEI

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (2)

On the extremal connective eccentricity index among trees with maximum degree ⋮ Eccentric connectivity coindex of bipartite graphs

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 maximal connective eccentricity index of bipartite graphs with some given parameters
• On eccentric connectivity index
• 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 maximum connective eccentricity index among k-connected graphs