On the extremal properties of the average eccentricity
From MaRDI portal
(Redirected from Publication:356266)
Abstract: The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity of a graph is the mean value of eccentricities of all vertices of . The average eccentricity is deeply connected with a topological descriptor called the eccentric connectivity index, defined as a sum of products of vertex degrees and eccentricities. In this paper we analyze extremal properties of the average eccentricity, introducing two graph transformations that increase or decrease . Furthermore, we resolve four conjectures, obtained by the system AutoGraphiX, about the average eccentricity and other graph parameters (the clique number, the Randi' c index and the independence number), refute one AutoGraphiX conjecture about the average eccentricity and the minimum vertex degree and correct one AutoGraphiX conjecture about the domination number.
Recommendations
Cites work
- scientific article; zbMATH DE number 5130720 (Why is no real title available?)
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 2114503 (Why is no real title available?)
- A survey of automated conjectures in spectral graph theory
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Average distance, minimum degree, and spanning trees
- Distance spectral radius of trees with fixed maximum degree
- Eccentric Connectivity Index of Chemical Trees
- Eccentric connectivity index extremal graphs and values
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- On distance-balanced graphs
- On eccentric connectivity index
- On the eccentric connectivity index of a graph
- On the eccentric distance sum of trees and unicyclic graphs
- Ordering trees by their largest eigenvalues
- Some new results on distance-based graph invariants
- The Estrada index of chemical trees
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
- Wiener index of trees: Theory and applications
Cited in
(35)- The Steiner \(k\)-eccentricity on trees
- The average Steiner \(( 3 , 2 )\)-eccentricity of trees
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- Further results regarding the sum of domination number and average eccentricity
- On AGX conjectures regarding average eccentricity
- Distance measurements related to Cartesian product of cycles
- On the average of the eccentricities of a graph
- Eccentricity based topological indices of an oxide network
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- On the relation between Wiener index and eccentricity of a graph
- Asymptotic properties of Fibonacci cubes and Lucas cubes
- Average eccentricity, minimum degree and maximum degree in graphs
- Total eccentricity index of graphs with fixed number of pendant or cut vertices
- On the maximal connective eccentricity index of bipartite graphs with some given parameters
- The Eccentricity Transform (of a Digital Shape)
- On connected graphs having the maximum connective eccentricity index
- Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
- On average eccentricity of graphs
- On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs
- Connective Steiner 3-eccentricity index and network similarity measure
- On graphs with maximum average eccentricity
- Ordering graphs with large eccentricity-based topological indices
- Eccentricity based topological indices of honeycomb networks
- A proof of the conjecture regarding the sum of domination number and average eccentricity
- On the extremal graphs with respect to the total reciprocal edge-eccentricity
- Bounds for eccentricity-based parameters of graphs
- The average eccentricity of a graph with prescribed girth
- On autographix conjecture regarding domination number and average eccentricity
- Upper bounds on the average eccentricity
- The first eigenvector of a distance matrix is nearly constant
- On the extremal total reciprocal edge-eccentricity of trees
- Some extremal results on the connective eccentricity index of graphs
- Eccentricity-based topological indices of a cyclic octahedron structure
- Edge-grafting transformations on the average eccentricity of graphs and their applications
- The average Steiner 3-eccentricity of block graphs
This page was built for publication: On the extremal properties of the average eccentricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q356266)
