The extremal values of connective eccentricity index for trees and unicyclic graphs
From MaRDI portal
Publication:5737875
DOI10.1080/00207160.2015.1112003zbMath1362.05076OpenAlexW2300165667MaRDI QIDQ5737875
No author found.
Publication date: 30 May 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2015.1112003
Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Unnamed Item
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- On the eccentric distance sum of graphs
- On the maximal energy tree with two maximum degree vertices
- On the eccentric distance sum of trees and unicyclic graphs
- Complete solution to a conjecture on the maximal energy of unicyclic graphs
- Bounds on the largest eigenvalues of trees with a given size of matching
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- On the extremal values of the eccentric distance sum of trees
- Wiener index of trees: Theory and applications
Related Items (7)
On the extremal connective eccentricity index among trees with maximum degree ⋮ A note on extremal trees with degree conditions ⋮ On the extremal graphs with respect to the total reciprocal edge-eccentricity ⋮ Valency-based topological descriptors of chemical networks and their applications ⋮ The eccentric adjacency index of unicyclic graphs and trees ⋮ Vertex-based and edge-based centroids of graphs ⋮ On the maximum connective eccentricity index among k-connected graphs
This page was built for publication: The extremal values of connective eccentricity index for trees and unicyclic graphs
