Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree
From MaRDI portal
Publication:2037591
DOI10.1016/j.disc.2021.112513zbMath1467.05061arXiv2002.03183MaRDI QIDQ2037591
Peter Dankelmann, S. Mafunda, Elizabeth Jonck
Publication date: 8 July 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.03183
Related Items
Proximity, remoteness and maximum degree in graphs, On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs, Proximity and remoteness in directed and undirected graphs, Diameter, edge-connectivity, and \(C_4\)-freeness
Cites Work
- Unnamed Item
- Unnamed Item
- Proximity and average eccentricity of a graph
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Radius, diameter, and minimum degree
- Extremal values for ratios of distances in trees
- Proximity, remoteness and girth in graphs
- Proximity and remoteness in directed and undirected graphs
- Proximity, remoteness and minimum degree
- The difference between remoteness and radius of a graph
- Average distance, radius and remoteness of a graph
- Proximity and remoteness in graphs: Results and conjectures
- Distance in graphs
- Wiener Index and Remoteness in Triangulations and Quadrangulations
- New bounds on proximity and remoteness in graphs