Well paired-dominated graphs
From MaRDI portal
Publication:711404
DOI10.1007/S10878-008-9203-8zbMATH Open1200.90142OpenAlexW2041621858MaRDI QIDQ711404FDOQ711404
Authors: S. L. Fitzpatrick, Bert L. Hartnell 
Publication date: 26 October 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9203-8
Recommendations
- Well-totally-dominated graphs
- Paired domination in graphs
- Paired-domination in graphs
- Pair dominating graphs
- On well-dominated graphs
- Dominating Pair Graphs
- Graphs with large paired-domination number
- On well-edge-dominated graphs
- The domination graphs of complete paired domination digraphs
- scientific article; zbMATH DE number 2188616
Cites Work
- Trees with paired-domination number twice their domination number
- Paired-domination in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paired-domination of Cartesian products of graphs
- Paired domination on interval and circular-arc graphs
- Paired-domination in generalized claw-free graphs
- Graphs with large paired-domination number
- Title not available (Why is that?)
- Ratios of some domination parameters in graphs and claw-free graphs
- Diameter of paired domination edge-critical graphs
- Upper total domination versus upper paired-domination
Cited In (9)
- Critical paired dominating sets and irreducible decompositions of powers of edge ideals
- Title not available (Why is that?)
- A note on connected dominating sets of distance-hereditary graphs
- Locating-paired-dominating sets in square grids
- Title not available (Why is that?)
- Locating and paired-dominating sets in graphs
- A new characterization of paired domination number of a graph
- Pair dominating graphs
- Minimal graphs with disjoint dominating and paired-dominating sets
This page was built for publication: Well paired-dominated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711404)
