\(k\)-domination and \(k\)-independence in graphs: A survey

DOI10.1007/s00373-011-1040-3zbMath1234.05174MaRDI QIDQ659765

Odile Favaron, Adriana Hansberg, Mustapha Chellali, Lutz Volkmann

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1040-3

zbMATH Keywords

connected \(k\)-domination; \(k\)-independence; \(k\)-tuple domination; \(k\)-domination; \(k\)-irredundance; \(k\)-star-forming; \(l\)-total \(k\)-domination

Mathematics Subject Classification ID

05-02: Research exposition (monographs, survey articles) pertaining to combinatorics

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

Related Items

Independent Roman domination and 2-independence in trees, Mixed Roman domination and 2-independence in trees, On the packing numbers in graphs, ANOTHER LOOK AT k-DOMINATION IN GRAPHS, On the signed 2-independence number of graphs, Edge domination and 2-independence in trees, A Taxonomy of Perfect Domination, Partial domination - the isolation number of a graph, The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products, Distinguished Minimal Topological Lassos, Roman domination and 2-independence in trees, On Approximating (Connected) 2-Edge Dominating Set by a Tree, 2-edge connected dominating sets and 2-connected dominating sets of a graph, Domatically full Cartesian product graphs, Conjecture of TxGraffiti: Independence, domination, and matchings, Unnamed Item, \( P_5\)-isolation in graphs, On the 2-independence subdivision number of graphs, Trees with 2-reinforcement number three, The difference between the metric dimension and the determining number of a graph, On the complexity of reinforcement in graphs, Algorithmic and structural aspects of the \(P_3\)-Radon number, 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, On vertex independence number of uniform hypergraphs, Trees with maximum \(p\)-reinforcement number, An upper bound on the \(P_3\)-Radon number, Upper bounds on the \(k\)-forcing number of a graph, NP-hardness of multiple bondage in graphs, A new generalization of kernels in digraphs, Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture, Bounds on weak Roman and 2-rainbow domination numbers, Independent \((k + 1)\)-domination in \(k\)-trees, Balanced independent and dominating sets on colored interval graphs, On the signed (total) \(k\)-independence number in graphs, On approximating (connected) 2-edge dominating set by a tree, Making a dominating set of a graph connected, Client-server and cost effective sets in graphs, Relating the annihilation number and the 2-domination number of block graphs, Bounds on the 2-domination number, Constructing dominating sets in circulant graphs, Algorithm to find a maximum 2-packing set in a cactus, Grundy dominating sequences and zero forcing sets, On bondage numbers of graphs: a survey with some comments, Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs, On (1,2)-domination in cubic graphs, Bipartite graphs with close domination and \(k\)-domination numbers, Admissible property of graphs in terms of radius, Perfect domination ratios of Archimedean lattices, A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs, Domination, independent domination and \(k\)-independence in trees, Decreasing the maximum degree of a graph, The annihilation number does not bound the 2-domination number from the above, Isolation of cycles, Isolation of \(k\)-cliques, Perfect Italian domination on planar and regular graphs, Domination number, independent domination number and 2-independence number in trees, \([1,k\)-domination number of lexicographic products of graphs], \( K_{1 , 2}\)-isolation in graphs, On the \(p\)-reinforcement and the complexity, Zero forcing in claw-free cubic graphs, MAX for \(k\)-independence in multigraphs, New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs, On the \(k\)-domination number of digraphs, On the complexity of multiple bondage in graphs, On general frameworks and threshold functions for multiple domination, A note on the annihilation number and 2-domination number of a tree, Graphs with \(\alpha _1\) and \(\tau _1\) both large, Covers and partial transversals of Latin squares, On upper bounds for multiple domination numbers of graphs, On \(k\)-domination and \(j\)-independence in graphs, Algorithmic aspects of the \(k\)-domination problem in graphs, Partitions of graphs into small and large sets, Heuristics for \(k\)-domination models of facility location problems in street networks, \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems, Thresholds for the monochromatic clique transversal game, The p-domination number of complete multipartite graphs, Multiple Domination, (Open) packing number of some graph products

Uses Software

GRAFFITI

Cites Work