Remoteness, proximity and few other distance invariants in graphs

DOI10.2298/FIL1308425SzbMath1324.05100arXiv1204.1184MaRDI QIDQ5252386

Jelena Sedlar

Publication date: 29 May 2015

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1184

zbMATH Keywords

proximityremotenessextremal treesdistance invariants

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (12)

Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph ⋮ Proximity, remoteness and distance eigenvalues of a graph ⋮ Minimum status of series-reduced trees with given parameters ⋮ On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs ⋮ Proximity, remoteness and maximum degree in graphs ⋮ Unnamed Item ⋮ Minimum status of trees with a given degree sequence ⋮ Proof of conjectures on remoteness and proximity in graphs ⋮ Which numbers are status differences? ⋮ Proximity, remoteness and girth in graphs ⋮ The difference between remoteness and radius of a graph ⋮ Simplified constructions of almost peripheral graphs and improved embeddings into them

This page was built for publication: Remoteness, proximity and few other distance invariants in graphs