A new upper bound on the total domination number in graphs with minimum degree six
From MaRDI portal
Publication:2043347
Recommendations
- On the domination number of graphs with minimum degree six
- A new upper bound on the total domination number of a graph
- Upper minus total domination number of 6-regular graph
- A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH
- A new bound on the domination number of graphs with minimum degree two
- A new lower bound on the total domination number of a graph
- On the domination number of Hamiltonian graphs with minimum degree six
- Total dominations in P₆-free graphs
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree
- An upper bound on the domination number of a graph with minimum degree 2
Cites work
- A new lower bound on the independence number of a graph and applications
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Covering all cliques of a graph
- Graphs with large total domination number
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- scientific article; zbMATH DE number 861353 (Why is no real title available?)
- scientific article; zbMATH DE number 892215 (Why is no real title available?)
- Hypergraphs with large transversal number and with edge sizes at least 3
- Independence in 5-uniform hypergraphs
- Small transversals in hypergraphs
- Some remarks on domination
- Total domination in graphs
- Total domination in graphs
- Total domination of graphs and small transversals of hypergraphs
- Transversal numbers of uniform hypergraphs
- Transversals in 5-uniform hypergraphs and total domination in graphs with minimum degree five
- Transversals in linear uniform hypergraphs
Cited in
(6)- Bounds on domination parameters in graphs: a brief survey
- \(k\)-domination and total \(k\)-domination numbers in catacondensed hexagonal systems
- Total dominations in P₆-free graphs
- A note on the Tuza constant c_k for small k
- A characterization of graphs with global 3-rainbow domination number equal to the number of vertices
- Extensions and applications of the Tuza-Vestergaard theorem
This page was built for publication: A new upper bound on the total domination number in graphs with minimum degree six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043347)