Graphs with equal independence and annihilation numbers

MaRDI QIDQ640438zbMATH OpenFDO

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

annihilation numbercritical independence numberIndependence numberKönig-Egerváry graphs

Mathematics Subject Classification ID

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

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

Cited in

(19)

• Bounding the locating-total domination number of a tree in terms of its annihilation number
• Critical and maximum independent sets of a graph
• Relating the annihilation number and the 2-domination number of block graphs
• Regular graphs with equal matching number and independence number
• New results relating independence and matchings
• Some more updates on an annihilation number conjecture: pros and cons
• On the König deficiency of zero-reducible graphs
• On some conjectures concerning critical independent sets of a graph
• Largest domination number and smallest independence number of forests with given degree sequence
• scientific article; zbMATH DE number 3752895 (Why is no real title available?)
• 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
• A way to construct independence equivalent graphs
• On an annihilation number conjecture
• Inflated graphs with equal independence number and upper irredundance number
• Counterexamples to the characterisation of graphs with equal independence and annihilation number
• Efficiently recognizing graphs with equal independence and annihilation numbers
• On 1-König-Egerváry graphs
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited

Describes a project that uses

Uses Software

• Graffiti.pc

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)