An upper bound for the total domination subdivision number of a graph
From MaRDI portal
Publication:968208
DOI10.1007/S00373-010-0877-1zbMATH Open1205.05169OpenAlexW2023962613MaRDI QIDQ968208FDOQ968208
Authors: Abdollah Khodkar, Hossein Karami, R. Khoeilar, Seyed Mahmood Sheikholeslami 
Publication date: 5 May 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0877-1
Recommendations
Cites Work
- Hidden superconformal symmetry in M-theory
- Title not available (Why is that?)
- Total domination subdivision numbers of graphs
- A new bound on the total domination subdivision number
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Cited In (11)
- Improved bounds for the extremal number of subdivisions
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Total domination subdivision numbers of trees
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)
