The difference between remoteness and radius of a graph
From MaRDI portal
Publication:2348060
DOI10.1016/J.DAM.2015.02.007zbMATH Open1315.05043OpenAlexW2076092588MaRDI QIDQ2348060FDOQ2348060
Yaojun Chen, Kinkar Ch. Das, Hongbo 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
Cites Work
- Proof of conjectures on adjacency eigenvalues of graphs
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Proof of conjectures on remoteness and proximity in graphs
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Proximity and remoteness in graphs: Results and conjectures
- Proximity and average eccentricity of a graph
- Remoteness, proximity and few other distance invariants in graphs
- Title not available (Why is that?)
- Nordhaus-Gaddum relations for proximity and remoteness in graphs
- Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs
- Conjectures on index and algebraic connectivity of graphs
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
Cited In (17)
- Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
- Average distance, radius and remoteness of a graph
- ON THE TOTAL DISTANCE AND DIAMETER OF GRAPHS
- On eccentric distance sum and degree distance of graphs
- Relations between degree-based graph invariants
- Proximity, remoteness and maximum degree in graphs
- The connective eccentricity index and modified second Zagreb index of Parikh word representable graphs
- Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree
- Remoteness and distance eigenvalues of a graph
- Comparing eccentricity-based graph invariants
- On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs
- Distance Laplacian spectra of graphs: a survey
- Proximity, remoteness and girth in graphs
- Relationships between some distance-based topological indices
- Comparative results and bounds for the eccentric-adjacency index
- Further results on the Merrifield-Simmons index
- Proximity and remoteness in graphs: a survey
Uses Software
Recommendations
This page was built for publication: The difference between remoteness and radius of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348060)
