Graphs with large total domination number
From MaRDI portal
Publication:4508619
DOI<21::AID-JGT3>3.0.CO;2-F 10.1002/1097-0118(200009)35:1<21::AID-JGT3>3.0.CO;2-FzbMath0959.05089OpenAlexW4230977099MaRDI QIDQ4508619
Publication date: 26 April 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200009)35:1<21::aid-jgt3>3.0.co;2-f
Related Items
Disjunctive total domination in graphs ⋮ Total domination in regular graphs ⋮ The diameter of total domination vertex critical graphs ⋮ Dominating sets inducing large components ⋮ Domination and total domination in complementary prisms ⋮ Total restrained bondage in graphs ⋮ Locating-total dominating sets in twin-free graphs: a conjecture ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Vertex-addition strategy for domination-like invariants ⋮ Domination in partitioned graphs with minimum degree two ⋮ Asymptotic bounds on total domination in regular graphs ⋮ Total domination critical and stable graphs upon edge removal ⋮ Total domination stable graphs upon edge addition ⋮ Girth and total domination in graphs ⋮ Total domination and the Caccetta-Häggkvist conjecture ⋮ Total domination dot-critical graphs ⋮ 3-component domination numbers in graphs ⋮ Algorithmic Aspects of Disjunctive Total Domination in Graphs ⋮ Dominating sets inducing large component in graphs with minimum degree two ⋮ On \(\alpha\)-total domination in graphs ⋮ Bounds on the disjunctive total domination number of a tree ⋮ Total domination versus domination in cubic graphs ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Total domination changing and stable graphs upon vertex removal ⋮ Unnamed Item ⋮ Equality in a linear Vizing-like relation that relates the size and total domination number of a graph ⋮ Signed total domination in graphs. ⋮ The numerical invariants concerning the total domination for generalized Petersen graphs ⋮ Total domination in claw-free graphs with minimum degree 2 ⋮ Bounds on total domination in claw-free cubic graphs ⋮ Total domination in partitioned trees and partitioned graphs with minimum degree two ⋮ On equality in an upper bound for the restrained and total domination numbers of a graph ⋮ On the upper total domination number of Cartesian products of graphs ⋮ Total restrained domination in graphs with minimum degree two ⋮ Partial domination - the isolation number of a graph ⋮ Essential upper bounds on the total domination number ⋮ On matching and total domination in graphs ⋮ Restricted total domination in graphs ⋮ An extremal problem for total domination stable graphs upon edge removal ⋮ Total domination dot-stable graphs ⋮ The total bondage number of grid graphs ⋮ Total domination in 2-connected graphs and in graphs with no induced 6-cycles ⋮ A survey of selected recent results on total domination in graphs ⋮ Minus total domination in graphs ⋮ 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 ⋮ Total domination in graphs with given girth ⋮ Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width ⋮ A constructive characterization of trees with equal total domination and disjunctive domination numbers ⋮ Total domination in partitioned graphs ⋮ A survey of stratified domination in graphs ⋮ Perfectly relating the domination, total domination, and paired domination numbers of a graph ⋮ Bounds on the domination number of a digraph and its reverse ⋮ Total Domination in Graphs with Diameter 2
Cites Work
This page was built for publication: Graphs with large total domination number
