On an annihilation number conjecture
From MaRDI portal
Publication:4988857
DOI10.26493/1855-3974.1950.8bdzbMath1464.05295arXiv1811.04722OpenAlexW3034753372WikidataQ123273587 ScholiaQ123273587MaRDI QIDQ4988857
Eugen Mandrescu, Vadim E. Levit
Publication date: 19 May 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.04722
treebipartite graphmatchingmaximum independent setKönig-Egerváry graphannihilation numberannihilation set
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (2)
Some more updates on an annihilation number conjecture: pros and cons ⋮ Counterexamples to the characterisation of graphs with equal independence and annihilation number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A set and collection lemma
- The critical independence number and an independence decomposition
- Graphs with equal independence and annihilation numbers
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Combinatorial properties of the family of maximum stable sets of a graph
- Bounding the locating-total domination number of a tree in terms of its annihilation number
- Hall's and Kőnig's theorem in graphs and hypergraphs
- Critical and maximum independent sets of a graph
- Relating the annihilation number and the 2-domination number of block graphs
- Problems on matchings and independent sets of a graph
- On the number of vertices belonging to all maximum stable sets of a graph
- On \(\alpha^{+}\)-stable König-Egerváry graphs
- Critical independent sets and König-Egerváry graphs
- Relating the annihilation number and the total domination number of a tree
- Monotonic properties of collections of maximum independent sets of a graph
- Two more characterizations of König-Egerváry graphs
- Forbidden subgraphs and the König-Egerváry property
- On maximum matchings in König-Egerváry graphs
- On some conjectures concerning critical independent sets of a graph
- Vertices Belonging to All Critical Sets of a Graph
- Bounding the paired-domination number of a tree in terms of its annihilation number
- Subgraph characterization of red/blue-split graph and kőnig egerváry graphs
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
- On König-Egerváry collections of maximum critical independent sets
- Relating the total domination number and the annihilation number of cactus graphs and block graphs
This page was built for publication: On an annihilation number conjecture
