scientific article; zbMATH DE number 1095171

Stephen T. Hedetniemi, Teresa W. Haynes, Peter J. Slater

Publication date: 8 December 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey dominating set domination independent sets domination number domatic number dominating functions invariants of graphs irredundant sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75)

Related Items (only showing first 100 items - show all)

Outer-2-independent domination in graphs ⋮ Some extremal properties of the multiplicatively weighted Harary index of a graph ⋮ Disjunctive total domination in graphs ⋮ Roman \(\{2 \}\)-domination ⋮ On the roots of domination polynomial of graphs ⋮ The quest for a characterization of hom-properties of finite character ⋮ On the first Zagreb index of polygraphs ⋮ Largest domination number and smallest independence number of forests with given degree sequence ⋮ Weighted restrained domination in subclasses of planar graphs ⋮ Enumerating minimal connected dominating sets in graphs of bounded chordality ⋮ Domination stability in graphs ⋮ Equality in a bound that relates the size and the restrained domination number of a graph ⋮ On trees with total domination number equal to edge-vertex domination number plus one ⋮ Computing Roman domatic number of graphs ⋮ An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification ⋮ Lower bounds on the signed total \(k\)-domination number of graphs ⋮ Neighborhood-restricted \([\leq 2\)-achromatic colorings] ⋮ (Total) vector domination for graphs with bounded branchwidth ⋮ Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Edge-removal and edge-addition in \(\alpha \)-domination ⋮ Signed Roman \(k\)-domination in digraphs ⋮ Edge criticality in graph domination ⋮ Isolate domination in graphs ⋮ The difference between the metric dimension and the determining number of a graph ⋮ Slash and burn on graphs -- firefighting with general weights ⋮ Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs ⋮ Resolving-power dominating sets ⋮ On the algorithmic complexity of edge total domination ⋮ Total and paired domination numbers of \(C_m\) bundles over a cycle \(C_n\) ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ Bicritical domination and double coalescence of graphs ⋮ Efficient domination through eigenvalues ⋮ On the signed total Roman domination and domatic numbers of graphs ⋮ New classes of panchromatic digraphs ⋮ Total restrained reinforcement in graphs ⋮ Completion and decomposition of hypergraphs into dominating sets of graphs ⋮ The \(k\)-hop connected dominating set problem: hardness and polyhedra ⋮ Some links between identifying codes and separating, dominating and total dominating sets in graphs ⋮ Quasiperfect domination in trees ⋮ Isolation in graphs ⋮ Dominating broadcast labeling in Cartesian products of graphs ⋮ Signed total Roman domination in graphs ⋮ The independent transversal dombondage number of a graph ⋮ Global 2-point set domination number of a graph ⋮ Domination in graphoidally covered graphs: least-kernel graphoidal covers ⋮ New analysis and computational study for the planar connected dominating set problem ⋮ Signed mixed Roman domination numbers in graphs ⋮ Total perfect codes in Cayley graphs ⋮ Location-domination in line graphs ⋮ Matchings, path covers and domination ⋮ Maximal 2-rainbow domination number of a graph ⋮ Trees with large \(m\)-eternal domination number ⋮ Liar's dominating sets in graphs ⋮ Structure of squares and efficient domination in graph classes ⋮ On the complexity of reinforcement in graphs ⋮ A note on non-dominating set partitions in graphs ⋮ Graphs with maximal induced matchings of the same size ⋮ Minimal dominating sets in interval graphs and trees ⋮ Algorithmic aspects of open neighborhood location-domination in graphs ⋮ On dominator colorings in graphs ⋮ The roman \(k\)-domatic number of a graph ⋮ Bounds on the 2-rainbow domination number of graphs ⋮ On the extremal properties of the average eccentricity ⋮ Some new perspectives on global domination in graphs ⋮ An upper bound for the total restrained domination number of graphs ⋮ Coloring, location and domination of corona graphs ⋮ On the ratio between 2-domination and total outer-independent domination numbers of trees ⋮ Subgroups as efficient dominating sets in Cayley graphs ⋮ Domination versus independent domination in cubic graphs ⋮ Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs ⋮ Minimal dominating sets in graph classes: combinatorial bounds and enumeration ⋮ Upper bounds on the signed (\(k, k\))-domatic number ⋮ Dominating functions and total dominating functions of countable graphs ⋮ Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems ⋮ Parameterized complexity of max-lifetime target coverage in wireless sensor networks ⋮ Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 ⋮ On the associated primes and the depth of the second power of squarefree monomial ideals ⋮ Relating the annihilation number and the 2-domination number of a tree ⋮ A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture ⋮ On the algorithmic complexity of \(k\)-tuple total domination ⋮ Domination and total domination in cubic graphs of large girth ⋮ \([1,2\)-domination in graphs] ⋮ A maximum degree theorem for diameter-2-critical graphs ⋮ Total transversals and total domination in uniform hypergraphs ⋮ Total restrained domination in graphs of diameter 2 or 3 ⋮ The price of connectivity for dominating set: upper bounds and complexity ⋮ Improved bounds on the domination number of a tree ⋮ \(k\)-tuple total domination in complementary prisms ⋮ A decidability result for the dominating set problem ⋮ On 3-\(\gamma_t\)-vertex critical graphs of diameter three ⋮ On the complexity of the bondage and reinforcement problems ⋮ On weighted efficient total domination ⋮ On the independent domination number of the generalized Petersen graphs ⋮ Directed domination in oriented graphs ⋮ \(k\)-rainbow domatic numbers ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ On \(\alpha\)-total domination in graphs ⋮ Vertex covers and eternal dominating sets ⋮ On the distribution of the domination number for random class cover catch digraphs ⋮ Trees with 2-reinforcement number three

This page was built for publication: