On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs
From MaRDI portal
Publication:2172411
DOI10.1016/j.dam.2022.06.037zbMath1497.05058arXiv2106.02500OpenAlexW3170323993WikidataQ113877178 ScholiaQ113877178MaRDI QIDQ2172411
Publication date: 15 September 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.02500
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Remoteness and distance eigenvalues of a graph
- 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
- Minimum statuses of connected graphs with fixed maximum degree and order
- Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree
- Proximity and remoteness in directed and undirected graphs
- Which numbers are status differences?
- Proximity, remoteness and minimum degree
- The difference between remoteness and radius of a graph
- Convex median and anti-median at prescribed distance
- Network descriptors based on betweenness centrality and transmission and their extremal values
- The median problem on \(k\)-partite graphs
- 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
- Remoteness, proximity and few other distance invariants in graphs
- New bounds on proximity and remoteness in graphs
This page was built for publication: On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs