Abstract
The annihilation number α of a graph is an upper bound of the independence number α of a graph. In this article we characterize graphs with equal independence and annihilation numbers. In particular, we show that α = a if, and only if, either (1) α ≥ n/2 and α' = a, or (2) a
Cite
CITATION STYLE
APA
Larson, C. E., & Pepper, R. (2011). Graphs with equal independence and annihilation numbers. Electronic Journal of Combinatorics, 18(1), 1–9. https://doi.org/10.37236/667
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free