Domination in graphs with minimum degree two
From MaRDI portal
Publication:3490039
DOI10.1002/jgt.3190130610zbMath0708.05058OpenAlexW2093990414MaRDI QIDQ3490039
Bruce Shepherd, William D. McCuaig
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190130610
Related Items
Improved upper bounds on the domination number of graphs with minimum degree at least five ⋮ Domination in planar graphs with small diameter* ⋮ Dominating sets inducing large components ⋮ Domination number in graphs with minimum degree two ⋮ Isolation in graphs ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Double Roman domination ⋮ Paired-Domination Game Played in Graphs ⋮ Decreasing the maximum degree of a graph ⋮ Upper bound on 3-rainbow domination in graphs with minimum degree 2 ⋮ Domination number of graphs with minimum degree five ⋮ Vertex-addition strategy for domination-like invariants ⋮ Domination in partitioned graphs with minimum degree two ⋮ Extremal graphs for a bound on the Roman domination number ⋮ Restricted domination in graphs with minimum degree 2 ⋮ On the structure of dominating graphs ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ Pairs of disjoint dominating sets in connected cubic graphs ⋮ Unnamed Item ⋮ Domination number and feedback vertex number of complements of line graphs ⋮ 3-component domination numbers in graphs ⋮ Monitoring the edges of a graph using distances with given girth ⋮ Complexity of majority monopoly and signed domination problems ⋮ Dominating sets inducing large component in graphs with minimum degree two ⋮ 2-connected graphs with small 2-connected dominating sets. ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Domination number and Laplacian eigenvalue distribution ⋮ Unnamed Item ⋮ Pairs of disjoint dominating sets and the minimum degree of graphs ⋮ Proofs of the AutoGraphiX conjectures on the domination number, average eccentricity and proximity ⋮ On roman, global and restrained domination in graphs ⋮ Domination number of graphs without small cycles ⋮ Combinatorics for smaller kernels: the differential of a graph ⋮ A note on the double Roman domination number of graphs ⋮ An upper bound on the double Roman domination number ⋮ Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs ⋮ Restricted domination parameters in graphs ⋮ Tropical dominating sets in vertex-coloured graphs ⋮ On the domination number of Hamiltonian graphs with minimum degree six ⋮ On the \(r\)-domination number of a graph ⋮ Partial domination - the isolation number of a graph ⋮ Domination in graphs of minimum degree at least two and large girth ⋮ A note on domination, girth and minimum degree ⋮ Graphs with large total domination number ⋮ Bounds of Laplacian spectrum of graphs based on the domination number ⋮ Domination in graphs of minimum degree five ⋮ On restricted domination in graphs ⋮ Lower bounds on the differential of a graph ⋮ An upper bound for domination number of 5-regular graphs ⋮ On the domination number of graphs with minimum degree six ⋮ Outer independent double Roman domination ⋮ A note on the eternal dominating set problem ⋮ Domination in bipartite graphs ⋮ On Domination Number of 4-Regular Graphs ⋮ Efficiency in exponential time for domination-type problems ⋮ An upper bound on the domination number of a graph with minimum degree 2 ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Rainbow Domination in Graphs ⋮ Paths, Stars and the Number Three ⋮ Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice ⋮ On the Roman domination number of a graph ⋮ Local metric dimension for graphs with small clique numbers ⋮ Graphs with large restrained domination number ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Domination with exponential decay ⋮ The differential of the strong product graphs ⋮ Domination number and neighbourhood conditions ⋮ Locating-dominating sets and identifying codes in graphs of girth at least 5 ⋮ General bounds on rainbow domination numbers ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ Three-arc graphs: characterization and domination
