Total Domination in Graphs
From MaRDI portal
Publication:4912481
DOI10.1007/978-1-4614-6525-6zbMath1408.05002OpenAlexW560340026MaRDI QIDQ4912481
Michael A. Henning, Anders Yeo
Publication date: 4 April 2013
Published in: Springer Monographs in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6525-6
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (only showing first 100 items - show all)
Total double Roman domination in graphs ⋮ A new lower bound on the total domination number of a graph ⋮ Strength of strongest dominating sets in fuzzy graphs ⋮ Chromatic total domination in graphs ⋮ PENDANT TOTAL DOMINATION NUMBER OF SOME GENERALIZED GRAPHS ⋮ Revisiting and Improving Upper Bounds for Identifying Codes ⋮ REGNANT AND CAPTIVE DOMINATION IN SOME GENERALIZED GRAPHS ⋮ Unnamed Item ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ Paired-Domination Game Played in Graphs ⋮ On the perfect differential of a graph ⋮ Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties ⋮ Graphs with disjoint 2-dominating sets ⋮ On the L-Grundy domination number of a graph ⋮ Total domination number of middle graphs ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ On domination-type invariants of Fibonacci cubes and hypercubes ⋮ Nordhaus-Gaddum bounds for upper total domination ⋮ NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs ⋮ Paired domination stability in graphs ⋮ Unnamed Item ⋮ A complete description of convex sets associated with matchings and edge‐connectivity in graphs ⋮ \( P_5\)-isolation in graphs ⋮ On domination in signed graphs ⋮ The total co-independent domination number of some graph operations ⋮ On the double total dominator chromatic number of graphs ⋮ A Note on Isolate Domination Number of a Cubic Graph ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ A sharp upper bound on the cycle isolation number of graphs ⋮ Graphs with equal domination and certified domination numbers ⋮ On domatic and total domatic numbers of Cartesian products of graphs ⋮ Paired-domination game played on cycles ⋮ A linear-time algorithm for semitotal domination in strongly chordal graphs ⋮ Fault-tolerant total domination via submodular function approximation ⋮ k-Efficient domination: Algorithmic perspective ⋮ 3-component domination numbers in graphs ⋮ Incidence‐free sets and edge domination in incidence graphs ⋮ Singleton coalition graph chains ⋮ On total domination and minimum maximal matchings in graphs ⋮ Bounds and extremal graphs for total dominating identifying codes ⋮ Dominating sets inducing large component in graphs with minimum degree two ⋮ On upper bounds for total k-domination number via the probabilistic method ⋮ Disjoint total dominating sets in near‐triangulations ⋮ The geometric-arithmetic index of trees with a given total domination number ⋮ Unnamed Item ⋮ Double vertex-edge domination ⋮ Packing in regular graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A note on improved upper bounds on the transversal number of hypergraphs ⋮ Semitotal domination in claw-free cubic graphs ⋮ Total domination and vertex-edge domination in tres ⋮ Unnamed Item ⋮ The forcing number of graphs with given girth ⋮ TOTAL DOMINATION POLYNOMIALS OF SOME SPLITTING GRAPHS ⋮ Unnamed Item ⋮ Perfect roman domination in regular graphs ⋮ Semitotal domination in claw-free cubic graphs ⋮ Total connected domination game ⋮ Partial domination - the isolation number of a graph ⋮ Algorithmic aspects of total Roman ${2}$-domination in graphs ⋮ k-tuple restrained domination in graphs ⋮ Hardness results of global total \(k\)-domination problem in graphs ⋮ A characterization of trees having a minimum vertex cover which is also a minimum total dominating set ⋮ Total dominator chromatic number of a graph ⋮ NP-completeness results for partitioning a graph into total dominating sets ⋮ Complexity and algorithms for semipaired domination in graphs ⋮ Matching, path covers, and total forcing sets ⋮ Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph ⋮ Dominator and Total Dominator Colorings in Graphs ⋮ An Introduction to Game Domination in Graphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Domination in Digraphs ⋮ Roman Domination in Graphs ⋮ On disjunctive domination in graphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Well-totally-dominated graphs ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Relating the total domination number and the annihilation number of cactus graphs and block graphs ⋮ A characterization of graphs with disjoint total dominating sets ⋮ A note on the open packing number in graphs ⋮ Total $k$-Rainbow domination numbers in graphs ⋮ Domination versus disjunctive domination in graphs ⋮ A constructive characterization of trees with equal total domination and disjunctive domination numbers ⋮ Total Roman {2}-domination in graphs ⋮ Unnamed Item ⋮ Partitioning the Vertices of a Graph into Two Total Dominating Sets ⋮ All My Favorite Conjectures Are Critical ⋮ My Favorite Domination Conjectures in Graph Theory Are Bounded ⋮ Total Transversals in Hypergraphs and Their Applications ⋮ GRUNDY DOMINATION SEQUENCES IN GENERALIZED CORONA PRODUCTS OF GRAPHS ⋮ Total k-rainbow reinforcement number in graphs ⋮ Trees with equal total domination and 2-rainbow domination numbers ⋮ Double outer-independent domination number of graphs ⋮ Algorithmic aspects of total Roman {3}-domination in graphs ⋮ On the domination number of a graph and its shadow graph ⋮ Total domination in cubic Knodel graphs ⋮ Acyclic total dominating sets in cubic graphs ⋮ Total Roman domination subdivision number in graphs ⋮ Disjunctive total domination in graphs
This page was built for publication: Total Domination in Graphs
