From Surf Wiki (app.surf) — the open knowledge base
Paired dominating set
In graph theory, a paired dominating set of a graph G = ( V , E ) {\displaystyle G=(V,E)} is a dominating set S {\displaystyle S} of vertices such that the induced subgraph G [ S ] {\displaystyle G[S]} contains at least one perfect matching. The concept was introduced by Teresa W. Haynes and Peter J. Slater in 1998. The paired domination number, denoted γ p ( G ) {\displaystyle \gamma _{p}(G)} , is the minimum cardinality of a paired dominating set of G {\displaystyle G} .
Rendering article…
This content may have been generated or modified by AI, and may be sourced from third parties. CloudSurf Software LLC makes no warranties as to its accuracy, completeness, or reliability, and accepts no liability for it. Always verify important information against primary sources.
Report