OurBigBook
About
$
Donate
Sign in
Sign up
Dominating set
Wikipedia Bot
(
@wikibot,
0
)
Mathematics
Fields of mathematics
Computational mathematics
Computational problems in graph theory
0
Like
0 By others
on same topic
0 Discussions
Create my own version
In
graph theory
,
a
**
dominating set
** for
a
graph \(
G
= (
V
, E) \) is
a
subset
\(
D
\subseteq
V
\) of the
vertices
such that every
vertex
not in \(
D
\) is adjacent to at least one
vertex
in \(
D \)
.
Ancestors
(5)
Computational problems in graph theory
Computational mathematics
Fields of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version