scientific article; zbMATH DE number 5054162
From MaRDI portal
Publication:5488345
zbMATH Open1100.05070MaRDI QIDQ5488345FDOQ5488345
Publication date: 14 September 2006
Title of this publication is not available (Why is that?)
Cited In (20)
- Title not available (Why is that?)
- A polynomial-time algorithm for the paired-domination problem on permutation graphs
- Title not available (Why is that?)
- Which trees have a differentiating-paired dominating set?
- Trees with the same degree sequence and path numbers
- Trees with equal total domination and game total domination numbers
- An upper bound on the paired-domination number in terms of the number of edges in the graph
- Trees with equal global offensive k-alliance and k-domination numbers
- Upper paired-domination in claw-free graphs
- Perfectly relating the domination, total domination, and paired domination numbers of a graph
- Paired-domination in generalized claw-free graphs
- Graphs with disjoint dominating and paired-dominating sets
- Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs
- Pair-sharing over rational trees
- Title not available (Why is that?)
- Graphs with large paired-domination number
- A characterization of graphs with disjoint dominating and paired-dominating sets
- Title not available (Why is that?)
- The diameter of paired-domination vertex critical graphs
- Paired Domination in Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488345)
