Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Bill Quan Yue"'
Autor:
Bill Quan Yue
Publikováno v:
Open Journal of Discrete Mathematics. :1-13
A graph G is said to have a perfect dominating set S if S is a set of vertices of G and for each vertex v of G, either v is in S and v is adjacent to no other vertex in S, or v is not in S but is adjacent to precisely one vertex of S. A graph G may h
Autor:
Bill Quan Yue, Allen J. Schwenk
Publikováno v:
Discrete Mathematics. 305:276-298
An oriented graph G→ is said to have an efficient dominating set S if S is a set of vertices of G→ and for each vertex v of G→, either v is in S and v is adjacent to no other vertex in S, or v is not in S but is adjacent from precisely one vert
Publikováno v:
Discrete Mathematics. :179-183
An out-domination set of a digraph D is a set S of vertices of D such that every vertex of D − S is adjacent from some vertex of S . The minimum cardinality of an out-domination set of D is the out-domination number γ + ( D ). The in-domination nu