On a novel eccentricity-based invariant of a graph
From MaRDI portal
Publication:2396735
DOI10.1007/S10114-016-5518-ZzbMATH Open1362.05044OpenAlexW2547380966MaRDI QIDQ2396735FDOQ2396735
Kinkar Ch. Das, A. Dılek Maden, Kexiang Xu
Publication date: 24 May 2017
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-016-5518-z
Recommendations
diametereccentricitynon-self-centrality numbernon-self-centered graphthird Zagreb eccentricity index
Cites Work
- Properties of connected graphs having minimum degree distance
- Some extremal properties of the degree distance of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trees with the seven smallest and eight greatest Harary indices
- Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
- On comparing Zagreb indices of graphs
- The number of caterpillars
- On the eccentric distance sum of trees and unicyclic graphs
- Further results on the eccentric distance sum
- The second Zagreb indices of unicyclic graphs with given degree sequences
- On Harary index of graphs
- On the Wiener index of generalized Fibonacci cubes and Lucas cubes
- Some properties of the Zagreb eccentricity indices
- Comparing Zagreb indices for connected graphs
- On difference of Zagreb indices
- On the connective eccentricity index of trees and unicyclic graphs with given diameter
- Title not available (Why is that?)
- Ordering connected graphs having small degree distances
- The Harary index of a graph
- Almost self-centered graphs
- Some extremal results on the connective eccentricity index of graphs
- Almost-peripheral graphs
- Facility Location Problems
- Eccentric graphs
- Almost self-centered median and chordal graphs
- Group centralization of network indices
- Comparison between the Szeged index and the eccentric connectivity index
- The total irregularity of a graph
Cited In (21)
- On the maximum value of the eccentric distance sums of cubic transitive graphs
- On the average of the eccentricities of a graph
- Further results on Zagreb eccentricity coindices
- Further results on non-self-centrality measures of graphs
- Embeddings into almost self-centered graphs of given radius
- The general Albertson irregularity index of graphs
- Non-self-centrality number of some molecular graphs
- Constructing almost peripheral and almost self-centered graphs revisited
- Title not available (Why is that?)
- Simplified constructions of almost peripheral graphs and improved embeddings into them
- On the number of \(k\)-matchings in graphs
- Comparison and extremal results on three eccentricity-based invariants of graphs
- Relations between total irregularity and non-self-centrality of graphs
- Distance-unbalancedness of graphs
- On two eccentricity-based topological indices of graphs
- Constructing uniform central graphs and embedding into them
- On the extremal values of the eccentric distance sum of trees with a given maximum degree
- Multiplicative version of eccentric connectivity index
- Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree
- Comparison between the non-self-centrality number and the total irregularity of graphs
- On the extremal values of the eccentric distance sum of trees with a given domination number
This page was built for publication: On a novel eccentricity-based invariant of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396735)
