Total domination in graphs
From MaRDI portal
Publication:3892276
DOI10.1002/net.3230100304zbMath0447.05039OpenAlexW2066561381WikidataQ126263651 ScholiaQ126263651MaRDI QIDQ3892276
Stephen T. Hedetniemi, E. J. Cockayne, Robyn M. Dawes
Publication date: 1980
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230100304
Related Items (only showing first 100 items - show all)
Total domination and least domination in a tree ⋮ A new approach on locally checkable problems ⋮ EQUITABLE DOMINATION IN GRAPHS ⋮ Total domination in regular graphs ⋮ Total domination subdivision numbers of trees ⋮ The diameter of total domination vertex critical graphs ⋮ Dominating sets inducing large components ⋮ Universal minimal total dominating functions of trees ⋮ Unnamed Item ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Total protection of lexicographic product graphs ⋮ Further progress on the total Roman \(\{2\}\)-domination number of graphs ⋮ On the forcing domination and the forcing total domination numbers of a graph ⋮ Graphs with diameter 2 and large total domination number ⋮ Vertex-addition strategy for domination-like invariants ⋮ Least domination in a graph ⋮ Asymptotic bounds on total domination in regular graphs ⋮ Unnamed Item ⋮ Complexity and bounds for disjunctive total bondage ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Nordhaus-Gaddum inequalities for domination in graphs ⋮ Total domination and the Caccetta-Häggkvist conjecture ⋮ The total \(\{k\}\)-domatic number of wheels and complete graphs ⋮ Maker-breaker total domination game ⋮ Total $k$-domination in strong product graphs ⋮ On the weak Roman domination number of lexicographic product graphs ⋮ Domination on hyperbolic graphs ⋮ Nordhaus-Gaddum bounds for total domination ⋮ Edge lifting and total domination in graphs ⋮ Disjunctive total domination in permutation graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Relating the total \(\{2\}\)-domination number with the total domination number of graphs ⋮ On matching and semitotal domination in graphs ⋮ Total and paired domination numbers of toroidal meshes ⋮ Bounds on neighborhood total domination in graphs ⋮ Algorithmic aspect of stratified domination in graphs ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ Equality in a linear Vizing-like relation that relates the size and total domination number of a graph ⋮ The algorithmic complexity of bondage and reinforcement problems in bipartite graphs ⋮ \(k\)-tuple total restrained domination in complementary prisms ⋮ The numerical invariants concerning the total domination for generalized Petersen graphs ⋮ Nordhaus-Gaddum results for the convex domination number of a graph ⋮ Total edge–vertex domination ⋮ On equality in an upper bound for the restrained and total domination numbers of a graph ⋮ Complexity of Total {k}-Domination and Related Problems ⋮ Total restrained domination numbers of trees ⋮ Roman dominating influence parameters ⋮ The total domination and total bondage numbers of extended de Bruijn and Kautz digraphs ⋮ \(F_3\)-domination problem of graphs ⋮ On upper total domination versus upper domination in graphs ⋮ On matching and total domination in graphs ⋮ Restricted total domination in graphs ⋮ The hub number, girth and Mycielski graphs ⋮ On the total outer-connected domination in graphs ⋮ Hardness results and approximation algorithm for total liar's domination in graphs ⋮ Total restrained domination in claw-free graphs ⋮ The geodetic number of the lexicographic product of graphs ⋮ On a conjecture of Murty and Simon on diameter 2-critical graphs ⋮ Exact and heuristic algorithms for the weighted total domination problem ⋮ A characterization of trees based on edge-deletion and its applications for domination-type invariants ⋮ Domination related parameters in the generalized lexicographic product of graphs ⋮ Simultaneous graph parameters: factor domination and factor total domination ⋮ New results on connected dominating structures in graphs ⋮ Bounding the \(k\)-rainbow total domination number ⋮ Minimum 2-tuple dominating set of permutation graphs ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ On graphs all of whose total dominating sequences have the same length ⋮ Remarks on restrained domination and total restrained domination in graphs ⋮ Minus total domination in graphs ⋮ Domination parameters in coronene torus network ⋮ Bounds on Laplacian eigenvalues related to total and signed domination of graphs ⋮ A new upper bound on the total domination number in graphs with minimum degree six ⋮ A continuous generalization of domination-like invariants ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Domination and Total Domination in Hypergraphs ⋮ Domination in Chessboards ⋮ Distance Domination in Graphs ⋮ Rainbow Domination in Graphs ⋮ DOMINATION, TOTAL DOMINATION AND OPEN PACKING OF THE CORCOR DOMAIN OF GRAPHENE ⋮ Well-totally-dominated graphs ⋮ Protection of lexicographic product graphs ⋮ Total Roman reinforcement in graphs ⋮ Maximum sizes of graphs with given domination parameters ⋮ Relating the size of a connected graph to its total and restricted domination numbers ⋮ Bounds on neighborhood total domination number in graphs ⋮ On domination parameters and maximum degree of a graph ⋮ Semitotal domination of Harary graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ The total bondage numbers and efficient total dominations of vertex-transitive graphs ⋮ Bounding the trace function of a hypergraph with applications ⋮ Total and paired domination numbers of cylinders ⋮ The complexity of finding harmless individuals in social networks ⋮ Corona domination number of graphs ⋮ Local mending ⋮ Perfectly relating the domination, total domination, and paired domination numbers of a graph ⋮ Total dominator colorings and total domination in graphs ⋮ On graphs with equal total domination and Grundy total domination numbers ⋮ Further results on packing related parameters in graphs ⋮ Domination in generalized Petersen graphs ⋮ Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
Cites Work
This page was built for publication: Total domination in graphs
