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
-
381“... belongs to every minimum dominating set of G, and bad if v does not belong to any minimum dominating set...”
Get full text
Article -
382“...A set S of vertices in a graph G is a total dominating set of G if every vertex of G is adjacent...”
Get full text
Article -
383“...In this paper, the concept of total dominating set and total domination number on anti fuzzy graph...”
Get full text
Article -
384“... the corresponding approximating results to the well-known approximations of the traditional Dominating Set problem...”
Get full text
Others -
385“...碩士 === 逢甲大學 === 資訊工程學系 === 101 === The CDS (Connected dominating set) is usually used in wireless...”
Get full text
Others -
386“... dominating set of G if and only if every vertex in V is in S or is adjacent to at least one...”
Get full text
Others -
387by Sadeghi, Elham“... backbone for wireless ad hoc networks, the connected dominating set problem has been widely studied. We...”
Published 2016
Get full text
-
388by Thacker, Derrick Wayne“...In a graph G=(V,E), a subset S ⊆ V is a double dominating set if every vertex in V is dominated...”
Published 2006
Get full text
Get full text
Others -
389by Chukwukere, Presley“...A set D of vertices in a graph G is a 2-dominating set of G if every vertex in V − D has at least...”
Published 2018
Get full text
Get full text
Others -
390“...Domination is a structural complexity of chemical molecular graphs. A dominating set in a...”
Get full text
Article -
391by Xue-gang Chen“...A dominating set \(S\) in a graph \(G\) is a tree dominating set of \(G\) if the subgraph induced...”
Published 2007-01-01
Get full text
Article -
392“...\) is called a perfect \(k\)-dominating set of \(G\) if every vertex \(v\) of \(G\) not in \(D\) is adjacent...”
Get full text
Article -
393“... G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a...”
Get full text
Article -
394“... is a path in G. A set S⊆V(G) is an F-dominating set of G if every vertex v is F-dominated by a vertex w...”
Get full text
Others -
395“... of its neighbors are in then the remaining neighbor is also in A set S is called a power dominating set...”
Get full text
Article -
396“... dominating set of G if each vertex of V is dominated by at least two vertices in D. The double...”
Get full text
Others -
397by Abel Cabrera-Martínez, Juan Carlos Hernández-Gómez, Ernesto Parra-Inza, José María Sigarreta Almira“...A set of vertices of a graph <i>G</i> is a total dominating set if every vertex of <i>G</i...”
Published 2020-02-01
Get full text
Article -
398“...A total dominating set <i>D</i> of a graph <i>G</i> is said to be a secure total dominating set...”
Get full text
Article -
399by Burger, Alewyn Petrus“... are adjacent if they are in the same row, column or diagonal. A set D of squares of Qn is a dominating set...”
Published 2015
Get full text
Others -
400