The difference between remoteness and radius of a graph

DOI10.1016/j.dam.2015.02.007zbMath1315.05043OpenAlexW2076092588MaRDI QIDQ2348060

Yaojun Chen, Kinkar Chandra Das, Hong-Bo Hua

Publication date: 10 June 2015

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

Full work available at URL: https://doi.org/10.1016/j.dam.2015.02.007

zbMATH Keywords

diameterradiusremotenesslow bound

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Related Items (14)

Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph ⋮ Remoteness and distance eigenvalues of a graph ⋮ On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs ⋮ Relationships between some distance-based topological indices ⋮ ON THE TOTAL DISTANCE AND DIAMETER OF GRAPHS ⋮ Proximity, remoteness and maximum degree in graphs ⋮ Further results on the Merrifield-Simmons index ⋮ Comparing eccentricity-based graph invariants ⋮ Comparative results and bounds for the eccentric-adjacency index ⋮ The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs ⋮ Proximity, remoteness and girth in graphs ⋮ Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree ⋮ On eccentric distance sum and degree distance of graphs ⋮ Relations between degree-based graph invariants

Uses Software

• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Proximity and average eccentricity of a graph
• Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
• Conjectures on index and algebraic connectivity of graphs
• Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• Nordhaus-Gaddum relations for proximity and remoteness in graphs
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Proof of conjectures on adjacency eigenvalues of graphs
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Proof of conjectures on remoteness and proximity in graphs
• Proximity and remoteness in graphs: Results and conjectures
• Remoteness, proximity and few other distance invariants in graphs

This page was built for publication: The difference between remoteness and radius of a graph