Graphs with equal independence and annihilation numbers

zbMath1238.05198MaRDI QIDQ640438

Ryan Pepper, Craig E. Larson

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p180.html

zbMATH Keywords

annihilation numberKönig-Egerváry graphscritical independence numberIndependence number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (14)

Largest domination number and smallest independence number of forests with given degree sequence ⋮ Bounding the locating-total domination number of a tree in terms of its annihilation number ⋮ On some conjectures concerning critical independent sets of a graph ⋮ New results relating independence and matchings ⋮ Some more updates on an annihilation number conjecture: pros and cons ⋮ Critical and maximum independent sets of a graph ⋮ Relating the annihilation number and the 2-domination number of a tree ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ Counterexamples to the characterisation of graphs with equal independence and annihilation number ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Efficiently recognizing graphs with equal independence and annihilation numbers ⋮ Relating the annihilation number and the 2-domination number of block graphs ⋮ On the König deficiency of zero-reducible graphs ⋮ On an annihilation number conjecture

Uses Software

• Graffiti.pc

This page was built for publication: Graphs with equal independence and annihilation numbers