Upper bounds on the paired domination subdivision number of a graph
From MaRDI portal
Publication:354438
DOI10.1007/S00373-012-1162-2zbMATH Open1268.05148OpenAlexW1976691234MaRDI QIDQ354438FDOQ354438
Authors: Yoshimi Egawa, Michitaka Furuya, Masanori Takatou 
Publication date: 19 July 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1162-2
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
treeperfect matchingpaired domination numberpaired dominating setpaired domination subdivision number
Cites Work
Cited In (13)
- A proof of a conjecture on the paired-domination subdivision number
- Combinatorial bounds on paired and multiple domination in triangulations
- Paired domination stability in graphs
- The structure of dominating subgraphs
- Title not available (Why is that?)
- Paired-domination in subdivided star-free graphs
- Upper bounds for the \(k\)-subdomination number of graphs
- Block graphs with large paired domination multisubdivision number
- Outer-paired domination in graphs
- Paired domination subdivision and multisubdivision numbers of graphs
- Paired-domination subdivision numbers of graphs
- Complexity of the paired domination subdivision problem
- The paired-domination and the upper paired-domination 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)
