Solution to a problem on the complexity of connective eccentric index of graphs

MaRDI QIDQ5159175zbMATH OpenFDO

Authors Xiaolin Chen, Huishu Lian

Publication date 26 October 2021

Full work available at URL https://match.pmf.kg.ac.rs/electronic_versions/Match82/n1/match82n1_133-138.pdf

Mathematics Subject Classification ID

Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• scientific article; zbMATH DE number 6750362
• On connective eccentricity index of graphs
• On the maximum connective eccentricity index among k-connected graphs
• On the connective eccentricity index of graphs with fixed clique number.
• The extremal values of connective eccentricity index for trees and unicyclic graphs

Cited in

(4)

• On graphs with maximum average eccentricity
• Comparative study of distance-based graph invariants
• Constructing new families of transmission irregular graphs
• General eccentric connectivity index of trees and unicyclic graphs

This page was built for publication: Solution to a problem on the complexity of connective eccentric index of graphs

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