Upper paired domination versus upper domination
From MaRDI portal
Publication:5024681
DOI10.46298/dmtcs.7331zbMath1483.05108arXiv2104.02446OpenAlexW4205905997MaRDI QIDQ5024681
Publication date: 27 January 2022
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.02446
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- Paired-domination in claw-free cubic graphs
- Upper paired-domination in claw-free graphs
- Graphs with large paired-domination number
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Computing a minimum paired-dominating set in strongly orderable graphs
- Total domination versus paired-domination in regular graphs
- Paired versus double domination in \(K_{1,r}\)-free graphs
- Algorithmic aspects of upper paired-domination in graphs
- A new lower bound on the domination number of a graph
- Paired-domination in generalized claw-free graphs
- All graphs with paired-domination number two less than their order
- Lower bounds for the domination number
- Paired Domination in Graphs
- The paired-domination and the upper paired-domination numbers of graphs
- Paired-domination in graphs
- Total domination versus paired domination
- Paired- and induced paired-domination in (E,net)-free graphs
- Lower bound on the domination number of a tree
- Upper total domination versus upper paired-domination
This page was built for publication: Upper paired domination versus upper domination
