Introduction to ``Topics on Domination

DOI10.1016/0012-365X(90)90343-GMaRDI QIDQ804605zbMATH OpenOpenAlexFDO

Authors Stephen T. Hedetniemi, Renu C. Laskar

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90343-g

zbMATH Keywords

dominating setsQueens problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Distance in graphs (05C12) Graph theory (05C99)

Review text

In this introductory paper to a special issue of this journal the authors pay some attention to the history of domination, its theoretical background, to new models and to algorithmic aspects.

Recommendations

• Topics in Domination in Graphs
• Domination in discrete structures -- new directions
• scientific article; zbMATH DE number 1124608
• scientific article; zbMATH DE number 1052841
• scientific article; zbMATH DE number 1095172
• An introduction to \((1,2)\)-domination graphs
• Domination in Graphs: Core Concepts
• scientific article; zbMATH DE number 1095171
• An introduction to game domination in graphs
• scientific article; zbMATH DE number 1161247

Cited in

(30)

• Complete description of forbidden subgraphs in the structural domination problem
• Chessboard graphs, related designs, and domination parameters
• Dominating cliques in chordal graphs
• The k-neighbor, r-domination problems on interval graphs
• On minimum intersection of two minimum dominating sets of interval graphs
• Parity dimension for graphs
• Dominating Cartesian products of cycles
• Algebraic approach to fasciagraphs and rotagraphs
• Domination and total domination on asteroidal triple-free graphs
• Isolation of \(k\)-cliques. II
• Decreasing the maximum degree of a graph
• Isolation of cycles
• Isolation of \(k\)-cliques
• Improved bottleneck domination algorithms
• Extensions of the Art Gallery Theorem
• Isolate domination in graphs
• Domination in graphoidally covered graphs: least-kernel graphoidal covers
• On graphs whose domination numbers equal their independent domination numbers
• scientific article; zbMATH DE number 1923205 (Why is no real title available?)
• Doubly connected bi-domination in graphs
• An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
• Isolation of connected graphs
• Some modified types of pitchfork domination and it's inverse
• Solution to a 3-path isolation problem for subcubic graphs
• Isolation of regular graphs, stars and k-chromatic graphs
• A study on captive domination in graphs
• Proof of a conjecture on isolation of graphs dominated by a vertex
• Solution to a problem on isolation of 3-vertex paths
• Isolation of non-triangle cycles in graphs
• Characterization of \(P_{6}\)-free graphs

This page was built for publication: Introduction to ``Topics on Domination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804605)