On the eccentric complexity of graphs
From MaRDI portal
Publication:2317938
DOI10.1007/s40840-017-0564-yzbMath1418.05060OpenAlexW2767817727MaRDI QIDQ2317938
Kexiang Xu, Tomislav Došlić, Yaser Alizadeh
Publication date: 13 August 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-017-0564-y
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items (7)
Comparing Wiener complexity with eccentric complexity ⋮ Further results on the Merrifield-Simmons index ⋮ On conjecture of Merrifield-Simmons index ⋮ Constructing new families of transmission irregular graphs ⋮ Comparison and extremal results on three eccentricity-based invariants of graphs ⋮ Relations between total irregularity and non-self-centrality of graphs ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some extremal results on the connective eccentricity index of graphs
- On the eccentric connectivity index of a graph
- Eccentric sequences in graphs
- Eccentric sequences and eccentric sets in graphs
- Computing the eccentric-distance sum for graph operations
- A new version of Zagreb indices
- On eccentric connectivity index
- The Diameter of a Graph and its Complement
This page was built for publication: On the eccentric complexity of graphs