Connected domination
From MaRDI portal
Publication:3384607
Recommendations
Cites work
- 2-connected graphs with small 2-connected dominating sets.
- 2-edge connected dominating sets and 2-connected dominating sets of a graph
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
- A characterization of \(3\)-\((\gamma _{c}, 2)\)-critical claw-free graphs which are not \(3\)-\(\gamma _{c }\)-critical
- A constructive characterization of total domination vertex critical graphs
- A general method in the theory of domination in graphs
- A greedy approximation for minimum connected dominating sets
- A note on connected domination critical graphs
- A note on weakly connected domination number in graphs.
- A survey of Nordhaus-Gaddum type relations
- A survey of selected recent results on total domination in graphs
- An extremal problem for edge domination insensitive graphs
- An inequality on connected domination parameters
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
- Approximation algorithms for connected dominating sets
- Arbres avec un nombre maximum de sommets pendants
- Average eccentricity, \(k\)-packing and \(k\)-domination in graphs
- Bounds of the number of leaves of spanning trees
- Bounds of the number of leaves of spanning trees in graphs without triangles
- Bounds on the connected \(k\)-domination number in graphs
- Bounds on the connected domination number of a graph
- Bounds relating the weakly connected domination number to the total domination number and the matching number
- Characterization of graphs with equal domination and connected domination numbers
- Characterization of graphs with equal domination and covering number
- Clustering and domination in perfect graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- Connected p-domination in graphs
- Connected Domatic Number in Planar Graphs
- Connected dominating set. Theory and applications
- Connected Domination and Spanning Trees with Many Leaves
- Connected domination critical graphs with cut vertices
- Connected domination critical graphs.
- Connected domination game
- Connected domination game played on Cartesian products
- Connected domination in maximal outerplanar graphs
- Connected domination number of a graph and its complement
- Connected domination stable graphs upon edge addition
- Connected domination subdivision numbers of graphs
- Connected domination: vertex criticality and matchings
- Constructing full spanning trees for cubic graphs
- Critical graphs with respect to total domination and connected domination
- Distance domination and distance irredundance in graphs
- Distance irredundance and connected domination numbers of a graph
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Domination alteration sets in graphs
- Domination critical graphs
- Domination dot-critical graphs
- Domination Numbers in Graphs with Removed Edge or Set of Edges
- Domination on Cocomparability Graphs
- Domination parameters of a graph and its complement
- Doubly chordal graphs, steiner trees, and connected domination
- Doubly connected domination subdivision numbers of graphs
- Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
- Extremal graphs for inequalities involving domination parameters
- Generalized connected domination in graphs
- Graphs with forbidden subgraphs and leaf number
- Graphs without induced P5and C5
- Hamilton cycles in split graphs with large minimum degree
- Hamiltonicity of connected domination critical graphs.
- Hamiltonicity of domination critical claw-free graphs
- Hamiltonicity, minimum degree and leaf number
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
- scientific article; zbMATH DE number 4014770 (Why is no real title available?)
- scientific article; zbMATH DE number 7034398 (Why is no real title available?)
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- scientific article; zbMATH DE number 5777935 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 4008449 (Why is no real title available?)
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 637618 (Why is no real title available?)
- scientific article; zbMATH DE number 1052836 (Why is no real title available?)
- scientific article; zbMATH DE number 1135751 (Why is no real title available?)
- scientific article; zbMATH DE number 1145918 (Why is no real title available?)
- scientific article; zbMATH DE number 1533291 (Why is no real title available?)
- scientific article; zbMATH DE number 2114467 (Why is no real title available?)
- scientific article; zbMATH DE number 861435 (Why is no real title available?)
- scientific article; zbMATH DE number 6464011 (Why is no real title available?)
- scientific article; zbMATH DE number 975351 (Why is no real title available?)
- scientific article; zbMATH DE number 5174847 (Why is no real title available?)
- scientific article; zbMATH DE number 2192183 (Why is no real title available?)
- scientific article; zbMATH DE number 5037210 (Why is no real title available?)
- Improved bounds for spanning trees with many leaves
- Inequalities of Nordhaus-Gaddum type for doubly connected domination number
- Leaf number and Hamiltonian \(C_4\)-free graphs
- Lower bounds on the leaf number in graphs with forbidden subgraphs
- Making a dominating set of a graph connected
- Matching properties in connected domination critical graphs
- Max-leaves spanning tree is APX-hard for cubic graphs
- Maximum size of a connected graph with given domination parameters
- Minimum connected dominating sets and maximal independent sets in unit disk graphs
- On 4-_c-critical graphs with cut-vertices
- On an open problem concerning total domination critical graphs
- On connected k-domination in graphs
- On connected k-domination numbers of graphs.
- On connected cutfree domination in graphs
- On distance connected domination numbers of graphs.
- On domination critical graphs with cutvertices having connected domination number 3
- On graphs for which the connected domination number is at most the total domination number
- On graphs with equal domination and connected domination numbers
- On graphs with equal total domination and connected domination numbers
- On Hadwiger's Number and the Stability Number
- On local edge connected domination critical graphs
- On the p-domination, the total domination and the connected domination numbers of graphs
- On the doubly connected domination number of a graph
- On the number of edges in graphs with a given connected domination number
- On the number of edges in graphs with a given weakly connected domination number
- On weakly connected domination in graphs
- On weakly connected domination in graphs. II.
- Perfect connected-dominant graphs
- Permutation graphs: Connected domination and Steiner trees
- Relations between packing and covering numbers of a tree
- Size, Order, and Connected Domination
- Some inequalities about connected domination number
- Some results on the independence number of connected domination critical graphs
- Some results related to the toughness of 3-domination critical graphs
- Spanning paths in graphs
- Spanning trees in graphs of minimum degree 4 or 5
- Spanning Trees with Many Leaves
- Spanning trees with many leaves
- Spanning trees with many leaves and average distance
- Spanning trees with many leaves in cubic graphs
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
- Steiner trees, connected domination and strongly chordal graphs
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- The complexity of domination problems in circle graphs
- The diameter of connected domination critical graphs.
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- The price of connectivity for dominating set: upper bounds and complexity
- Total domination of graphs and small transversals of hypergraphs
- Traceability of connected domination critical graphs
- Unit disk graphs
- Upper bounds on the average eccentricity
- Vertex domination-critical graphs
- Vertex domination‐critical graphs
- Weakly connected domination critical graphs
- Weakly connected domination stable trees.
Cited in
(10)- A proof of a conjecture on the connected domination number
- Leafy spanning \(k\)-forests
- Disprove of a conjecture on the doubly connected domination subdivision number
- Connected domination stable graphs upon edge addition
- scientific article; zbMATH DE number 3873384 (Why is no real title available?)
- Set domination in graphs
- Connected domination value in graphs
- Connected \(dr\)-power dominating sets in graphs
- Connected domination versus dominating sets inducing large components
- TAR reconfiguration for vertex set parameters
This page was built for publication: Connected domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384607)
