Proximity and remoteness in directed and undirected graphs

DOI10.1016/j.disc.2020.112252zbMath1467.05056arXiv2001.10253OpenAlexW3112452992MaRDI QIDQ2222950

Jiangdong Ai, Stefanie Gerke, Gregory Gutin, S. Mafunda

Publication date: 27 January 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

regular graphtournamentregular digraphaverage distancestrongly connected oriented graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (4)

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 ⋮ Minimum status of trees with a given degree sequence ⋮ Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree

Cites Work

• Unnamed Item
• The radii of n-partite tournaments
• Extremal values for ratios of distances in trees
• Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree
• Proximity, remoteness and minimum degree
• Proximity and remoteness in graphs: Results and conjectures
• Basic Terminology, Notation and Results
• New bounds on proximity and remoteness in graphs
• Digraphs

This page was built for publication: Proximity and remoteness in directed and undirected graphs