A characterization of radius-critical graphs

DOI10.1002/JGT.3190120409MaRDI QIDQ3197851zbMATH OpenOpenAlexFDO

Authors Siemion Fajtlowicz

Publication date 1988

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190120409

zbMATH Keywords

ciliater-critical graphsradis

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• On critical and cocritical radius edge-invariant graphs
• Changing and unchanging of the radius of a graph
• On the radius and diameter of the clique graph
• Publication:4714631
• Recognizing diameter critical graphs

Cited in

(8)

• Changing and unchanging of the radius of a graph
• A characterization of graphs where the independence number equals the radius
• scientific article; zbMATH DE number 2084268 (Why is no real title available?)
• On critical and cocritical radius edge-invariant graphs
• Minimum degree, edge-connectivity and radius
• The number of edges in a bipartite graph of given radius
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
• Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number

This page was built for publication: A characterization of radius-critical graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197851)