Graphs with equal independence and annihilation numbers
zbMATH Open1238.05198MaRDI QIDQ640438FDOQ640438
Authors: Craig E. Larson, Ryan Pepper 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On an annihilation number conjecture
- Some more updates on an annihilation number conjecture: pros and cons
- The critical independence number and an independence decomposition
- A characterization of König-Egerváry graphs using a common property of all maximum matchings
- Relating the annihilation number and the total domination number for some graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)
Cited In (18)
- Relating the annihilation number and the 2-domination number of a tree
- Inflated graphs with equal independence number and upper irredundance number
- On an annihilation number conjecture
- 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
- Title not available (Why is that?)
- A way to construct independence equivalent graphs
- On the König deficiency of zero-reducible graphs
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Critical and maximum independent sets of a graph
- Some more updates on an annihilation number conjecture: pros and cons
- Efficiently recognizing graphs with equal independence and annihilation numbers
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
- New results relating independence and matchings
- Counterexamples to the characterisation of graphs with equal independence and annihilation number
- Relating the annihilation number and the 2-domination number of block graphs
- Regular graphs with equal matching number and independence number
Uses Software
This page was built for publication: Graphs with equal independence and annihilation numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640438)
