Counterexamples to the characterisation of graphs with equal independence and annihilation number

DOI10.37236/11458arXiv2202.07529WikidataQ124804469 ScholiaQ124804469MaRDI QIDQ6117243

Michaela Hiller

Publication date: 16 February 2024

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

Full work available at URL: https://arxiv.org/abs/2202.07529

zbMATH Keywords

independence numberannihilation numbercritical independence number

Mathematics Subject Classification ID

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

Cites Work

• The critical independence number and an independence decomposition
• Graphs with equal independence and annihilation numbers
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• On an annihilation number conjecture
• Paths, Trees, and Flowers
• Efficiently recognizing graphs with equal independence and annihilation numbers

This page was built for publication: Counterexamples to the characterisation of graphs with equal independence and annihilation number