Upper bounds on the average eccentricity
From MaRDI portal
Publication:2440101
DOI10.1016/J.DAM.2013.11.023zbMATH Open1284.05194OpenAlexW2017229004MaRDI QIDQ2440101FDOQ2440101
Authors: Peter Dankelmann, Simon Mukwembi 
Publication date: 27 March 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.11.023
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- AutoGraphiX: a survey
- Title not available (Why is that?)
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- 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
- Average distance and independence number
- ON DISTANCES IN CHROMATIC GRAPHS
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
- The average distance and the independence number
- Domination, radius, and minimum degree
- Average distance and domination number
- Eccentric sequences in graphs
- Average distance and domination number revisited
- Average distance, independence number, and spanning trees
Cited In (27)
- On the average Steiner 3-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
- Some extremal problems on the distance involving peripheral vertices of trees with given matching number
- The normality and sum of normalities of trees
- Eccentricity sums in trees
- 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
- Upper bounds on the average eccentricity of \(K_3\)-free and \(C_4\)-free graphs
- On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs
- On graphs with maximum average eccentricity
- Constructing uniform central graphs and embedding into them
- Ordering graphs with large eccentricity-based topological indices
- On average eccentricity
- Eccentric counts, connectivity and chordality
- 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
- On the extremal properties of the average eccentricity
- Edge-grafting transformations on the average eccentricity of graphs and their applications
- Connected domination
- The average Steiner 3-eccentricity of block graphs
- Bounds on the general eccentric distance sum of graphs
Uses Software
This page was built for publication: Upper bounds on the average eccentricity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440101)
