Pages that link to "Item:Q640438"

The following pages link to Graphs with equal independence and annihilation numbers (Q640438):

Displaying 17 items.

• Largest domination number and smallest independence number of forests with given degree sequence (Q277645) (← links)
• Relating the annihilation number and the 2-domination number of a tree (Q394342) (← links)
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
• A way to construct independence equivalent graphs (Q452914) (← links)
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
• Bounding the locating-total domination number of a tree in terms of its annihilation number (Q1630920) (← links)
• Critical and maximum independent sets of a graph (Q1671323) (← links)
• Relating the annihilation number and the 2-domination number of block graphs (Q1741511) (← links)
• Regular graphs with equal matching number and independence number (Q2074360) (← links)
• New results relating independence and matchings (Q2151222) (← links)
• Some more updates on an annihilation number conjecture: pros and cons (Q2164992) (← links)
• On the König deficiency of zero-reducible graphs (Q2292142) (← links)
• On some conjectures concerning critical independent sets of a graph (Q2629485) (← links)
• (Q3936780) (← links)
• On an annihilation number conjecture (Q4988857) (← links)
• Inflated graphs with equal independence number and upper irredundance number (Q5959093) (← links)
• Efficiently recognizing graphs with equal independence and annihilation numbers (Q6161447) (← links)