Changing and unchanging of the radius of a graph

DOI10.1016/0024-3795(94)00153-5zbMath0820.05020OpenAlexW1973798506WikidataQ127830955 ScholiaQ127830955MaRDI QIDQ1805308

Sirisha R. Medidi, Ronald D. Dutton, Robert C. Brigham

Publication date: 12 June 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00153-5

zbMATH Keywords

distanceextremal graphsminimalcriticalmaximalanticriticalantimaximalantiminimalradius of graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (2)

Radius-edge-invariant and diameter-edge-invariant graphs ⋮ THE DIAMETER AND RADIUS OF RADIALLY MAXIMAL GRAPHS

Cites Work

• Domination alteration sets in graphs
• An extremal problem for edge domination insensitive graphs
• Parallel concepts in graph theory
• The dissimilarity characteristic of Husimi trees
• Vertex domination-critical graphs
• Domination critical graphs
• Domination critical graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Changing and unchanging of the radius of a graph