On the extremal properties of the average eccentricity
From MaRDI portal
Publication:356266
DOI10.1016/J.CAMWA.2012.04.023zbMATH Open1268.05057arXiv1106.2987OpenAlexW2016213103MaRDI QIDQ356266FDOQ356266
Authors: Aleksandar Ilić 
Publication date: 25 July 2013
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1106.2987
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distance spectral radius of trees with fixed maximum degree
- Ordering trees by their largest eigenvalues
- Wiener index of trees: Theory and applications
- The Estrada index of chemical trees
- Title not available (Why is that?)
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- On eccentric connectivity index
- Eccentric connectivity index extremal graphs and values
- On the eccentric connectivity index of a graph
- Some new results on distance-based graph invariants
- On the eccentric distance sum of trees and unicyclic graphs
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- Title not available (Why is that?)
- Average distance, minimum degree, and spanning trees
- Eccentric Connectivity Index of Chemical Trees
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- A survey of automated conjectures in spectral graph theory
- On distance-balanced graphs
Cited In (35)
- The average Steiner \(( 3 , 2 )\)-eccentricity of trees
- The Steiner \(k\)-eccentricity on trees
- On AGX conjectures regarding average eccentricity
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- Further results regarding the sum of domination number and average eccentricity
- Distance measurements related to Cartesian product of cycles
- Eccentricity based topological indices of an oxide network
- On the average of the eccentricities of a graph
- Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity
- Total eccentricity index of graphs with fixed number of pendant or cut vertices
- On the relation between Wiener index and eccentricity of a graph
- Average eccentricity, minimum degree and maximum degree in graphs
- Asymptotic properties of Fibonacci cubes and Lucas cubes
- 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
- On the extremal graphs with respect to the total reciprocal edge-eccentricity
- A proof of the conjecture regarding the sum of domination number and average 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
- The first eigenvector of a distance matrix is nearly constant
- Upper bounds on the average eccentricity
- 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
Uses Software
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)
