On \(k\)-domination and \(j\)-independence in graphs

DOI10.1016/j.dam.2013.02.008zbMath1287.05102OpenAlexW1502785494MaRDI QIDQ2446328

Ryan Pepper, Adriana Hansberg

Publication date: 16 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.02.008

zbMATH Keywords

independencedomination\(k\)-domination\(j\)-independence

Mathematics Subject Classification ID

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

Related Items (17)

Domination, independent domination and \(k\)-independence in trees ⋮ 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 vertex independence number of uniform hypergraphs ⋮ \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems ⋮ Total \(k\)-domination in Cartesian product of complete graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ New results on \(k\)-independence of graphs ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ Multiple Domination ⋮ Bipartite graphs with close domination and \(k\)-domination numbers ⋮ Independent \((k + 1)\)-domination in \(k\)-trees ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs ⋮ Regular independent sets

Cites Work

• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A note on the k-domination number of a graph
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• New approach to the \(k\)-independence number of a graph
• Bounds on the \(k\)-domination number of a graph
• A new bound on the domination number of connected cubic graphs
• On graphs with equal domination and 2-domination numbers
• Independent sets in triangle-free cubic planar graphs
• Degree Sequence Index Strategy
• Independence andk-domination in graphs
• Onk-domination and minimum degree in graphs
• An upper bound for thek-domination number of a graph
• Some Ramsey-Type Numbers and the Independence Ratio
• Claw-free graphs with equal 2-domination and domination numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On \(k\)-domination and \(j\)-independence in graphs