Upper bounds on the paired domination subdivision number of a graph
From MaRDI portal
(Redirected from Publication:354438)
Recommendations
- Paired-domination subdivision numbers of graphs
- A proof of a conjecture on the paired-domination subdivision number
- Paired domination subdivision and multisubdivision numbers of graphs
- Upper bounds on the paired-domination number
- An upper bound on the paired-domination number in terms of the number of edges in the graph
Cites work
- scientific article; zbMATH DE number 1185309 (Why is no real title available?)
- scientific article; zbMATH DE number 1934399 (Why is no real title available?)
- Domination Subdivision Numbers
- Graph theory
- Paired-domination in graphs
- Paired-domination subdivision numbers of graphs
- Total domination subdivision numbers of graphs
Cited in
(13)- Paired-domination in subdivided star-free graphs
- Block graphs with large paired domination multisubdivision number
- Complexity of the paired domination subdivision problem
- A proof of a conjecture on the paired-domination subdivision number
- The paired-domination and the upper paired-domination numbers of graphs
- Outer-paired domination in graphs
- Combinatorial bounds on paired and multiple domination in triangulations
- Paired domination subdivision and multisubdivision numbers of graphs
- scientific article; zbMATH DE number 6107236 (Why is no real title available?)
- Paired domination stability in graphs
- Upper bounds for the \(k\)-subdomination number of graphs
- The structure of dominating subgraphs
- Paired-domination subdivision numbers of graphs
This page was built for publication: Upper bounds on the paired 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 Q354438)