An upper bound for the total domination subdivision number of a graph
From MaRDI portal
(Redirected from Publication:968208)
Recommendations
Cites work
- scientific article; zbMATH DE number 1934399 (Why is no real title available?)
- scientific article; zbMATH DE number 6107236 (Why is no real title available?)
- scientific article; zbMATH DE number 5238996 (Why is no real title available?)
- A new bound on the total domination subdivision number
- Bounding the total domination subdivision number of a graph in terms of its order
- Disproof of a conjecture on the subdivision domination number of a graph
- Hidden superconformal symmetry in M-theory
- Total domination subdivision numbers of graphs
Cited in
(14)- On two conjectures concerning total domination subdivision number in graphs
- On the total domination subdivision number in graphs
- Improved bounds for the extremal number of subdivisions
- scientific article; zbMATH DE number 6107236 (Why is no real title available?)
- On the total domination subdivision number in some classes of graphs
- On the total domination subdivision numbers in graphs
- Bounding the total domination subdivision number of a graph in terms of its order
- Upper bounds for the \(k\)-subdomination number of graphs
- Total domination and total domination subdivision number of a graph and its complement
- A new bound on the total domination subdivision number
- On a conjecture concerning total domination subdivision number in graphs
- scientific article; zbMATH DE number 1934399 (Why is no real title available?)
- Total domination subdivision numbers of trees
- On the total domination subdivision numbers of grid graphs
This page was built for publication: An upper bound for the total domination subdivision number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968208)