Bibliography on domination in graphs and some basic definitions of domination parameters

DOI10.1016/0012-365X(90)90365-OMaRDI QIDQ810066zbMATH 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)90365-o

zbMATH Keywords

domination numberdominating setbibliographyindependence number

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99) Bibliographies for mathematics in general (00A15)

Recommendations

• scientific article; zbMATH DE number 1161247
• Bounds on domination parameters in graphs: a brief survey
• scientific article; zbMATH DE number 4070954
• scientific article; zbMATH DE number 4085681
• Isolate domination in graphs

Cites work

• scientific article; zbMATH DE number 4014770 (Why is no real title available?)
• scientific article; zbMATH DE number 4130427 (Why is no real title available?)
• scientific article; zbMATH DE number 4130428 (Why is no real title available?)
• scientific article; zbMATH DE number 4132213 (Why is no real title available?)
• scientific article; zbMATH DE number 3829953 (Why is no real title available?)
• scientific article; zbMATH DE number 3834009 (Why is no real title available?)
• scientific article; zbMATH DE number 4177120 (Why is no real title available?)
• scientific article; zbMATH DE number 3648727 (Why is no real title available?)
• scientific article; zbMATH DE number 3882469 (Why is no real title available?)
• scientific article; zbMATH DE number 3144145 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3843791 (Why is no real title available?)
• scientific article; zbMATH DE number 3843803 (Why is no real title available?)
• scientific article; zbMATH DE number 3847429 (Why is no real title available?)
• scientific article; zbMATH DE number 3859049 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3869363 (Why is no real title available?)
• scientific article; zbMATH DE number 3871413 (Why is no real title available?)
• scientific article; zbMATH DE number 3873384 (Why is no real title available?)
• scientific article; zbMATH DE number 3878376 (Why is no real title available?)
• scientific article; zbMATH DE number 3891419 (Why is no real title available?)
• scientific article; zbMATH DE number 4202288 (Why is no real title available?)
• scientific article; zbMATH DE number 4204392 (Why is no real title available?)
• scientific article; zbMATH DE number 5073493 (Why is no real title available?)
• scientific article; zbMATH DE number 4137820 (Why is no real title available?)
• scientific article; zbMATH DE number 4150229 (Why is no real title available?)
• scientific article; zbMATH DE number 3815677 (Why is no real title available?)
• scientific article; zbMATH DE number 3817755 (Why is no real title available?)
• scientific article; zbMATH DE number 3896983 (Why is no real title available?)
• scientific article; zbMATH DE number 3902703 (Why is no real title available?)
• scientific article; zbMATH DE number 3906528 (Why is no real title available?)
• scientific article; zbMATH DE number 3906530 (Why is no real title available?)
• scientific article; zbMATH DE number 3910441 (Why is no real title available?)
• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 3917707 (Why is no real title available?)
• scientific article; zbMATH DE number 3918387 (Why is no real title available?)
• scientific article; zbMATH DE number 3919840 (Why is no real title available?)
• scientific article; zbMATH DE number 3929034 (Why is no real title available?)
• scientific article; zbMATH DE number 3933079 (Why is no real title available?)
• scientific article; zbMATH DE number 3959487 (Why is no real title available?)
• scientific article; zbMATH DE number 3970787 (Why is no real title available?)
• scientific article; zbMATH DE number 3970788 (Why is no real title available?)
• scientific article; zbMATH DE number 3974289 (Why is no real title available?)
• scientific article; zbMATH DE number 3977044 (Why is no real title available?)
• scientific article; zbMATH DE number 3983200 (Why is no real title available?)
• scientific article; zbMATH DE number 4008435 (Why is no real title available?)
• scientific article; zbMATH DE number 4008448 (Why is no real title available?)
• scientific article; zbMATH DE number 4008449 (Why is no real title available?)
• scientific article; zbMATH DE number 4010553 (Why is no real title available?)
• scientific article; zbMATH DE number 4012671 (Why is no real title available?)
• scientific article; zbMATH DE number 4024784 (Why is no real title available?)
• scientific article; zbMATH DE number 4039319 (Why is no real title available?)
• scientific article; zbMATH DE number 4043889 (Why is no real title available?)
• scientific article; zbMATH DE number 4045182 (Why is no real title available?)
• scientific article; zbMATH DE number 4045183 (Why is no real title available?)
• scientific article; zbMATH DE number 4049086 (Why is no real title available?)
• scientific article; zbMATH DE number 4051684 (Why is no real title available?)
• scientific article; zbMATH DE number 4053037 (Why is no real title available?)
• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 4055636 (Why is no real title available?)
• scientific article; zbMATH DE number 4055676 (Why is no real title available?)
• scientific article; zbMATH DE number 4057564 (Why is no real title available?)
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• scientific article; zbMATH DE number 4060740 (Why is no real title available?)
• scientific article; zbMATH DE number 4063108 (Why is no real title available?)
• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 4066950 (Why is no real title available?)
• scientific article; zbMATH DE number 4075103 (Why is no real title available?)
• scientific article; zbMATH DE number 4081531 (Why is no real title available?)
• scientific article; zbMATH DE number 4085681 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 4087718 (Why is no real title available?)
• scientific article; zbMATH DE number 4091561 (Why is no real title available?)
• scientific article; zbMATH DE number 4093496 (Why is no real title available?)
• scientific article; zbMATH DE number 4095496 (Why is no real title available?)
• scientific article; zbMATH DE number 4095510 (Why is no real title available?)
• scientific article; zbMATH DE number 4101267 (Why is no real title available?)
• scientific article; zbMATH DE number 4103125 (Why is no real title available?)
• scientific article; zbMATH DE number 4104992 (Why is no real title available?)
• scientific article; zbMATH DE number 4105008 (Why is no real title available?)
• scientific article; zbMATH DE number 3661345 (Why is no real title available?)
• scientific article; zbMATH DE number 3663191 (Why is no real title available?)
• scientific article; zbMATH DE number 3674114 (Why is no real title available?)
• scientific article; zbMATH DE number 3675921 (Why is no real title available?)
• scientific article; zbMATH DE number 3677872 (Why is no real title available?)
• scientific article; zbMATH DE number 3691392 (Why is no real title available?)
• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 3713756 (Why is no real title available?)
• scientific article; zbMATH DE number 3720947 (Why is no real title available?)
• scientific article; zbMATH DE number 3739597 (Why is no real title available?)
• scientific article; zbMATH DE number 3747181 (Why is no real title available?)
• scientific article; zbMATH DE number 3747184 (Why is no real title available?)
• scientific article; zbMATH DE number 3747186 (Why is no real title available?)
• scientific article; zbMATH DE number 3763968 (Why is no real title available?)
• scientific article; zbMATH DE number 3765843 (Why is no real title available?)
• scientific article; zbMATH DE number 3779382 (Why is no real title available?)
• scientific article; zbMATH DE number 3784915 (Why is no real title available?)
• scientific article; zbMATH DE number 22648 (Why is no real title available?)
• scientific article; zbMATH DE number 60247 (Why is no real title available?)
• scientific article; zbMATH DE number 3465337 (Why is no real title available?)
• scientific article; zbMATH DE number 3477177 (Why is no real title available?)
• scientific article; zbMATH DE number 3477211 (Why is no real title available?)
• scientific article; zbMATH DE number 3477212 (Why is no real title available?)
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3531438 (Why is no real title available?)
• scientific article; zbMATH DE number 3536105 (Why is no real title available?)
• scientific article; zbMATH DE number 3536133 (Why is no real title available?)
• scientific article; zbMATH DE number 3549014 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3573908 (Why is no real title available?)
• scientific article; zbMATH DE number 3577214 (Why is no real title available?)
• scientific article; zbMATH DE number 3596896 (Why is no real title available?)
• scientific article; zbMATH DE number 3618215 (Why is no real title available?)
• scientific article; zbMATH DE number 3628994 (Why is no real title available?)
• scientific article; zbMATH DE number 3634300 (Why is no real title available?)
• scientific article; zbMATH DE number 3639678 (Why is no real title available?)
• scientific article; zbMATH DE number 515530 (Why is no real title available?)
• scientific article; zbMATH DE number 568805 (Why is no real title available?)
• scientific article; zbMATH DE number 1043893 (Why is no real title available?)
• scientific article; zbMATH DE number 1043909 (Why is no real title available?)
• scientific article; zbMATH DE number 2544 (Why is no real title available?)
• scientific article; zbMATH DE number 4121429 (Why is no real title available?)
• scientific article; zbMATH DE number 3799700 (Why is no real title available?)
• scientific article; zbMATH DE number 3801572 (Why is no real title available?)
• scientific article; zbMATH DE number 846942 (Why is no real title available?)
• scientific article; zbMATH DE number 844153 (Why is no real title available?)
• scientific article; zbMATH DE number 867663 (Why is no real title available?)
• scientific article; zbMATH DE number 867715 (Why is no real title available?)
• scientific article; zbMATH DE number 3895104 (Why is no real title available?)
• scientific article; zbMATH DE number 975353 (Why is no real title available?)
• scientific article; zbMATH DE number 975402 (Why is no real title available?)
• scientific article; zbMATH DE number 975414 (Why is no real title available?)
• scientific article; zbMATH DE number 3221976 (Why is no real title available?)
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)
• scientific article; zbMATH DE number 3307328 (Why is no real title available?)
• scientific article; zbMATH DE number 3346385 (Why is no real title available?)
• scientific article; zbMATH DE number 3358515 (Why is no real title available?)
• scientific article; zbMATH DE number 3375531 (Why is no real title available?)
• scientific article; zbMATH DE number 3385656 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3407700 (Why is no real title available?)
• scientific article; zbMATH DE number 3405983 (Why is no real title available?)
• scientific article; zbMATH DE number 3417476 (Why is no real title available?)
• scientific article; zbMATH DE number 4189776 (Why is no real title available?)
• scientific article; zbMATH DE number 3060538 (Why is no real title available?)
• R -Domination in Graphs
• A Best Possible Heuristic for the k-Center Problem
• A Characterization of Soft Hypergraphs
• A Class of Polynomially Solvable Set-Covering Problems
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
• A Linear Recognition Algorithm for Cographs
• A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
• A class of threshold and domishold graphs: Equistable and equidominating graphs
• A linear algorithm for finding a minimum dominating set in a cactus
• A linear algorithm for the domination number of a series-parallel graph
• A linear algorithm for the domination number of a tree
• A note on distance-dominating cycles
• A note on total domination
• A sufficient condition for dominating cycles
• A theorem about a conjecture of H. Meyniel on kernel-perfect graphs
• A unified approach to domination problems on interval graphs
• Algorithms for generalized stability numbers of tree graphs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An efficient algorithm for maxdominance, with applications
• An extremal problem for edge domination insensitive graphs
• An optimal algorithm for finding dominating cycles in circular-arc graphs
• An upper bound for thek-domination number of a graph
• An upper bound on the domination number of a graph.
• Best location of service centers in a treelike network under budget constraints
• Bichromaticity and domatic number of a bipartite graph
• Bipartite permutation graphs
• Bottleneck extrema
• Bounds for the covering number of a graph
• Characterizations of strongly chordal graphs
• Chessboard domination problems
• Chordal graphs and upper irredundance, upper domination and independence
• Chromatic partitions of a graph
• Clustering and domination in perfect graphs
• Complexity of finding k-path-free dominating sets in graphs
• Computation of Dominating Partitions
• Contributions to the theory of domination, independence and irredundance in graphs
• Covering all cliques of a graph
• Covering, Packing and Generalized Perfection
• Critical concepts in domination
• Decomposition of Finite Graphs into Open Chains
• Disjoint independent dominating sets in graphs
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Domatically cocritical graphs
• Domatically critical and domatically full graphs
• Dominating Set and Converse Dominating Set of a Directed Graph
• Dominating Sets in Chordal Graphs
• Dominating cliques in graphs
• Dominating cycles in Halin graphs
• Dominating sets and domatic number of circular arc graphs
• Dominating sets for split and bipartite graphs
• Dominating sets in perfect graphs
• Domination alteration sets in graphs
• Domination and location in acyclic graphs
• Domination critical graphs
• Domination critical graphs
• Domination in graphs with minimum degree two
• Domination in permutation graphs
• Domination on Cocomparability Graphs
• Domination parameters for the bishops graph
• Domination theory and the crapo β-invariant
• Domination, independent domination, and duality in strongly chordal graphs
• Domination-balanced graphs
• Edge Dominating Sets in Graphs
• Edge-domatic number of a graph
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Enclaveless sets and MK-Systems
• Estimations for the domination number of a graph
• Existence of dominating cycles and paths
• Factor domination in graphs
• Finding a minimum independent dominating set in a permutation graph
• Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
• Finding minimum dominating cycles in permutation graphs
• Gallai theorems for graphs, hypergraphs, and set systems
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Graphs with unique maximal clumpings
• Independent domination in chordal graphs
• Indominable graphs cannot be characterised by a family of forbidden subgraphs
• Inequalities between the domination number and the chromatic number of a graph
• Irredundance number versus domination number
• Irredundant ramsey numbers for graphs
• Labeling algorithms for domination problems in sun-free chordal graphs
• Line domination in graphs
• Linear Separation of Dominating Sets in Graphs
• Linear algorithms on recursive representations of trees
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Linear-time computation of optimal subgraphs of decomposable graphs
• Lower Ramsey numbers for graphs
• Matchings and transversals in hypergraphs, domination and independence in trees
• Minimum dominating cycles in 2-trees
• Minimum dominating cycles in outerplanar graphs
• On k-domatic numbers of graphs
• On Hadwiger's Number and the Stability Number
• On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints
• On Spanning and Dominating Circuits in Graphs
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• On covering sets and error-correcting codes
• On domination and independence numbers of graphs
• On domination and independent domination numbers of a graph
• On domination problems for permutation and other graphs
• On generalised minimal domination parameters for paths
• On graphs having domination number half their order
• On kernels and semikernels of digraphs
• On kernels in i-triangulated graphs
• On kernels in strongly connected graphs
• On minimum dominating sets with minimum intersection
• On the Algorithmic Complexity of Total Domination
• On the Fractional Solution to the Set Covering Problem
• On the Set-Covering Problem
• On the computational complexity of upper fractional domination
• On the diagonal queens domination problem
• On the domination of the products of graphs II: Trees
• On the independent queens covering problem
• On the product of upper irredundance numbers of a graph and its complement
• On the queen domination problem
• On the sum of cardinalities of extremum maximal independent sets
• On the sum of two parameters concerning independence and irredundance in a graph
• Optimum domination in weighted trees
• Packing and Covering Constants for Certain Families of Trees. II
• Packing and covering constants for certain families of trees. I
• Partial Complement of a Graph
• Partitioning trees: Matching, domination, and maximum diameter
• Perfect stables in graphs
• Permutation graphs: Connected domination and Steiner trees
• Polygon Graph Recognition
• Properties of Hereditary Hypergraphs and Middle Graphs
• Quasi-kernels of minimum weakness in a graph
• R-domination of block graphs
• Regular totally domatically full graphs
• Relations between packing and covering numbers of a tree
• Some Packing Problems
• Some remarks on domatic numbers of graphs
• Stability, domination and irredundance in a graph
• Steiner trees, connected domination and strongly chordal graphs
• Structure and recognition of domishold graphs
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• The Maximum Coverage Location Problem
• The NP-completeness column: An ongoing guide
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• The bigraph decomposition number of a graph
• The bondage number of a graph
• The discipline number of a graph
• The distance-domination numbers of trees
• The irredundance number and maximum degree of a graph
• The least point covering and domination numbers of a graph
• The neighbourhood number of a graph
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Total Domination and Irredundance in Weighted Interval Graphs
• Total domination in block graphs
• Total domination in graphs
• Total domination in interval graphs
• Total domination in interval graphs
• Total domination in interval graphs revisited
• Towards a theory of domination in graphs
• Two Bounds for the Domination Number of a Graph
• Two algorithms for determining a minimum independent dominating set
• Two-Processor Scheduling with Start-Times and Deadlines
• Uniquely Partitionable Graphs
• Unit disk graphs
• Vertex domination-critical graphs

Cited in

(73)

• On Congruent Domination Number of Disjoint and One Point Union of Graphs
• Super domination polynomial of a graph
• Proof of a conjecture on isolation of graphs dominated by a vertex
• Convexity of minimal total dominating functions in graphs
• A study on captive domination in graphs
• A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo F
• An upper bound for the independent domination number
• Nordhaus-Gaddum inequalities for domination in graphs
• Domination number of an interval catch digraph family and its use for testing uniformity
• CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY
• Minimum r-neighborhood covering set of permutation graphs
• Online landmark replacement for out-of-sample dimensionality reduction methods
• Paired-domination problem on distance-hereditary graphs
• Dominating sets in finite generalized quadrangles
• An algorithm for prescribed multiple domination in arbitrary graphs
• Upper and lower bounds on approximating weighted mixed domination
• Isolation of regular graphs and \(k\)-chromatic graphs
• Irredundance perfect graphs
• Minimal dominating set problem studied by simulated annealing and cavity method: analytics and population dynamics
• Isolation of connected graphs
• An optimal algorithm to find minimum k-hop dominating set of interval graphs
• Decreasing the maximum degree of a graph
• Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
• Domination in graphoidally covered graphs: least-kernel graphoidal graphs. II
• An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
• The domination numbers of cylindrical grid graphs
• Isolation of squares in graphs
• Irredundant and perfect neighbourhood sets in trees
• ON WEAK DOMINATION NUMBER OF SOME GRAPHS
• SOME RESULTS ON WEAK DOMINATION IN GRAPHS
• Linear programming formulation for some generalized domination parameters
• A linear-time algorithm for weighted paired-domination on block graphs
• Extensions of the Art Gallery Theorem
• Data exploration by representative region selection: axioms and convergence
• Isolation of cycles
• Closed neighborhood ideals of finite simple graphs
• Isolation of \(k\)-cliques
• A linear-time algorithm for paired-domination on circular-arc graphs
• Domination and upper domination of direct product graphs
• Secure equitability in graphs
• A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
• On independent domination number of regular graphs
• Edge domination in some path and cycle related graphs
• On bondage numbers of graphs: a survey with some comments
• The domination complexity and related extremal values of large 3D torus
• Convexity of minimal dominating functions of trees. II
• Real and integer domination in graphs
• Solution to a 3-path isolation problem for subcubic graphs
• On generalised minimal domination parameters for paths
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
• The product of the independent domination numbers of a graph and its complement
• Semi-total domination in unit disk graphs and general graphs
• Domination in direct products of complete graphs
• Some new results on captive dominating sets in graphs
• Weighted efficient domination problem on some perfect graphs
• Isolation of regular graphs, stars and k-chromatic graphs
• On the domination number of cross products of graphs
• Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
• On the domination number of $t$-constrained de Bruijn graphs
• scientific article; zbMATH DE number 1923205 (Why is no real title available?)
• Some results on universal minimal total dominating functions
• Domination and irredundance in the queens' graph
• Admissible property of graphs in terms of independence number
• Domination in distance-hereditary graphs
• Total Roman domination and total domination in unit disk graphs
• Isolation of \(k\)-cliques. II
• The sequence of upper and lower domination, independence and irredundance numbers of a graph
• Unions of digraphs which become kernel perfect
• The e-mail gossip number and the connected domination number
• Strong weak domination and domination balance in a graph
• Semi-total domination in unit disk graphs
• Leaf sector covers with applications on circle graphs
• Bounds on the size of the minimum dominating sets of some cylindrical grid graphs

This page was built for publication: Bibliography on domination in graphs and some basic definitions of domination parameters

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