A characterization of graphs where the independence number equals the radius

DOI10.1007/s00373-011-1054-xzbMath1256.05164OpenAlexW1997604000MaRDI QIDQ1926039

Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper, Bill Waller

Publication date: 27 December 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1054-x

zbMATH Keywords

independence numberradiuspath numberscaffoldtree numberciliatebipartite numberforest number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Uses Software

• GRAFFITI

Cites Work

• Maximum induced trees in graphs
• A mod \(k\) index theorem
• E ₁₁ and M theory
• A characterization of radius-critical graphs
• A characterization of graphs without long induced paths
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of graphs where the independence number equals the radius