Generalized connected domination in graphs

MaRDI QIDQ5387666zbMATH OpenFDO

Authors Mekkia Kouider, Preben Dahl Vestergaard

Publication date 27 May 2008

Full work available at URL https://eudml.org/doc/129513, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/issue/view/82/showToc.html

zbMATH Keywords

connected dominationtrees

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 2192183
• The connected domination and tree domination of P(n,k) for k=1,2, n/2 .
• On connected k-domination numbers of graphs.
• On graphs with equal connected domination and 2-connected domination numbers
• Bounds on the connected \(k\)-domination number in graphs

Cited in

(12)

• Leafy spanning \(k\)-forests
• Generalized perfect domination in graphs
• Dominating a family of graphs with small connected subgraphs
• The connected domination and tree domination of P(n,k) for k=1,2, n/2 .
• Connected domination
• scientific article; zbMATH DE number 2042782 (Why is no real title available?)
• scientific article; zbMATH DE number 6124435 (Why is no real title available?)
• CONNECTED SUPER DOMINATION IN GRAPHS
• scientific article; zbMATH DE number 6424505 (Why is no real title available?)
• A note on some parameters of domination on the edge neighborhood graph of a graph
• A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks
• \(m\)-dominating \(k\)-trees of graphs

This page was built for publication: Generalized connected domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387666)