Degree Sequence Index Strategy

zbMath1296.05147arXiv1210.1805MaRDI QIDQ2876022

Yair Caro, Ryan Pepper

Publication date: 15 August 2014

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

zbMATH Keywords

\(k\)-independenceannihilation number\(k\)-domination numbers

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

A note on the annihilation number and 2-domination number of a tree ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination

Uses Software

• GreedyMAX

This page was built for publication: Degree Sequence Index Strategy