New bounds on proximity and remoteness in graphs
From MaRDI portal
Publication:5269919
DOI10.22049/CCO.2016.13543zbMATH Open1365.05073OpenAlexW2531359238MaRDI QIDQ5269919FDOQ5269919
Publication date: 28 June 2017
Full work available at URL: https://doaj.org/article/5021e6d3ae9f4e77ab1bb529cecc7846
Cited In (12)
- Average distance, radius and remoteness of a graph
- Essential Constraints of Edge-Constrained Proximity Graphs
- Eccentric completion of a graph
- Remoteness, proximity and few other distance invariants in graphs
- Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree
- A relation between proximity and the third largest distance eigenvalue of a graph
- Wiener Index and Remoteness in Triangulations and Quadrangulations
- Proximity and remoteness in directed and undirected graphs
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs
- Proximity in triangulations and quadrangulations
- Proximity and remoteness in graphs: a survey
This page was built for publication: New bounds on proximity and remoteness in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269919)
