Suggested Topics within your search.
Suggested Topics within your search.
History of engineering and technology
3
Mathematics & science
2
QA75.5-76.95 Electronic computers. Computer science
2
Research & information: general
2
Bi-regular graphs
1
Concept hierarchy
1
Connected Dominating Set
1
Connected domination number
1
Dominating set problem (DSP)
1
Dominating uniqueness
1
Domination
1
Domination polynomial
1
Doubly connected domination number
1
Electric energies
1
Electric power transmission networks
1
Electricity loss
1
Energy transfer
1
Gossiping problem
1
Graph theory
1
Graphic methods
1
Grid graphs
1
Information retrieval
1
Knödel graph
1
Monophonic
1
QA Mathematics
1
Rectangular grid graph
1
Rectangular grids
1
Regular graphs
1
Security
1
Smart grid
1
-
21by 吳政軒“...碩士 === 國立交通大學 === 應用數學系所 === 98 === In a semi-power domination set (SPDS) system, we place...”
Published 2010
Get full text
Others -
22by MAYRA CARVALHO ALBUQUERQUESubjects: “...[en] DOMINATING SET...”
Published 2018
Get full text
Get full text
Get full text
-
23“... set E. A subset S (S ⊆ V∪E) is a mixed dominating set if every element x ∈ (V∪E)\S is either adjacent...”
Get full text
Others -
24
-
25
-
26
-
27by Howard, Jamie MarieSubjects: “...differentiating total dominating set...”
Published 2004
Get full text
Get full text
Others -
28
-
29by Mateusz NikodemSubjects: “...liar's dominating set...”
Published 2012-01-01
Get full text
Article -
30
-
31“...Let G=(V,E) be a simple graph. A set S⊆V is a dominating set of G, if every vertex in V...”
Get full text
Article -
32“...) is called a dominating set of G if N [S] = V (G). And we say that S is a secure-dominating set of G...”
Get full text
Others -
33by Jie Wang, Lei Zhang, Wenda Zhu, Yuhang Jiang, Wenmin Wu, Xipeng Xu, Dawei ZhaoSubjects: “...minimum dominating set...”
Published 2021-01-01
Get full text
Article -
34by Ma, Ka Leung“...This thesis presents a new way to find the dominating set of a graph by introducing the concept...”
Published 1998
Get full text
Get full text
Others -
35“... $S subseteq V(G) is called a dominating set of G if N[S] = V(G). In addition, S is called a secure-dominating...”
Get full text
Others -
36“...碩士 === 國立中正大學 === 資訊工程研究所 === 100 === Let G = (V;E) be a simple undirected graph. A dominating set...”
Get full text
Others -
37“...A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a...”
Get full text
Article -
38
-
39
-
40“... of applying connected dominating set on broadcasting in vehicular ad-hoc networks (VANETs). First, a broadcast...”
Get full text
Others