Towards a theory of domination in graphs
From MaRDI portal
Publication:4163261
DOI10.1002/net.3230070305zbMath0384.05051OpenAlexW2019262465MaRDI QIDQ4163261
E. J. Cockayne, Stephen T. Hedetniemi
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070305
Related Items (only showing first 100 items - show all)
A linear algorithm for finding a minimum dominating set in a cactus ⋮ A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs ⋮ On graphs having domination number half their order ⋮ Computing Roman domatic number of graphs ⋮ Isolation of \(k\)-cliques. II ⋮ Line domination in graphs ⋮ Domination in fuzzy incidence graphs based on valid edges ⋮ An improved exact algorithm for the domatic number problem ⋮ On the signed total Roman domination and domatic numbers of graphs ⋮ Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) ⋮ The signed edge-domatic number of a graph ⋮ Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka) ⋮ The diversity of domination ⋮ Strong weak domination and domination balance in a graph ⋮ One-node cutsets and the dominating set polytope ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ A survey of the theory of hypercube graphs ⋮ Dominating sets in social network graphs ⋮ Decreasing the maximum degree of a graph ⋮ The signed edge-domatic number of nearly cubic graphs ⋮ Well irredundant graphs ⋮ Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs ⋮ Dot product graphs and domination number ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Coloring, location and domination of corona graphs ⋮ Isolation of cycles ⋮ Nordhaus-Gaddum inequalities for domination in graphs ⋮ The signed total Roman \(k\)-domatic number of a graph ⋮ Domination versus independent domination in cubic graphs ⋮ Isolation of \(k\)-cliques ⋮ The total \(\{k\}\)-domatic number of wheels and complete graphs ⋮ On the independent domination number of regular graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Laplacian distribution and domination ⋮ On the dominating set polytope ⋮ Partitioning vertices into in- and out-dominating sets in digraphs ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Injective coloring of graphs revisited ⋮ Extensions of the Art Gallery Theorem ⋮ Contributions to the theory of domination, independence and irredundance in graphs ⋮ The weighted perfect domination problem ⋮ Graphs with small Italian domatic number ⋮ Nordhaus-Gaddum bounds for locating domination ⋮ On upper domination Ramsey numbers for graphs. ⋮ Pairs of disjoint dominating sets and the minimum degree of graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ On the \(b\)-domatic number of graphs ⋮ Towards a new framework for domination ⋮ A note on the independent domination number in graphs ⋮ Independent domination in chordal graphs ⋮ \(k\)-tuple total restrained domination in complementary prisms ⋮ Chordal graphs and upper irredundance, upper domination and independence ⋮ Regular totally domatically full graphs ⋮ Domatically critical and domatically full graphs ⋮ The least point covering and domination numbers of a graph ⋮ Maximum number of edges in connected graphs with a given domination number ⋮ The signed Roman \(k\)-domatic number of a graph ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ The Roman \(\{2 \}\)-domatic number of graphs ⋮ Novel applications of bipolar fuzzy graphs to decision making problems ⋮ A simple linear time algorithm for the domatic partition problem on strongly chordal graphs ⋮ An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model ⋮ Constrained domatic bipartition on trees ⋮ Idomatic partitions of direct products of complete graphs ⋮ Energy of double dominating bipolar fuzzy graphs ⋮ A tight bound on the number of mobile servers to guarantee transferability among dominating configurations ⋮ Star partitions on graphs ⋮ Nordhaus-Gaddum bounds on the \(k\)-rainbow domatic number of a graph ⋮ The complexity of total edge domination and some related results on trees ⋮ The \(\{k\}\)-domatic number of a graph ⋮ Resolving dominating partitions in graphs ⋮ Exact and heuristic algorithms for the weighted total domination problem ⋮ The roman domatic number of a graph ⋮ Disjoint independent dominating sets in graphs ⋮ Outer independent double Roman domination ⋮ On minimal geodetic domination in graphs ⋮ Domination-complete graphs ⋮ On domination and independence numbers of graphs ⋮ On domination and independent domination numbers of a graph ⋮ A study on triple connected total perfect domination in fuzzy graphs ⋮ On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset ⋮ Admissible property of graphs in terms of independence number ⋮ Signed domatic number of a graph ⋮ Remarks about disjoint dominating sets ⋮ Real and integer domination in graphs ⋮ The domatic number of block-cactus graphs ⋮ Domination, independent domination, and duality in strongly chordal graphs ⋮ Metric-locating-dominating sets of graphs for constructing related subsets of vertices ⋮ Dominating sets for split and bipartite graphs ⋮ Further results on 2-distance coloring of graphs ⋮ Perfectly relating the domination, total domination, and paired domination numbers of a graph ⋮ Finding minimum dominating cycles in permutation graphs ⋮ Transitivity on subclasses of bipartite graphs ⋮ Efficient edge domination problems in graphs ⋮ The sequence of upper and lower domination, independence and irredundance numbers of a graph ⋮ What is the difference between the domination and independent domination numbers of a cubic graph? ⋮ A note on total domination ⋮ Dominating sets and domatic number of circular arc graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ The domatic number problem
Cites Work
This page was built for publication: Towards a theory of domination in graphs
