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
-
401“...A paired dominating set of a graph G = (V(G),E(G)) is a set D of vertices of G such that every...”
Get full text
Article -
402“... is called a total dominating set if any vertex of $G$ is adjacent to some vertex of $S$. The total...”
Get full text
Article -
403by Włodzimierz Ulatowski“...\) is defined to be the minimum cardinality of a paired-dominating set of \(G\). Let \(G\) be a graph of order...”
Published 2013-01-01
Get full text
Article -
404by Mustapha Chellali“...A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex...”
Published 2006-01-01
Get full text
Article -
405by Marcin Krzywkowski“...A total outer-independent dominating set of a graph \(G=(V(G),E(G))\) is a set \(D\) of vertices...”
Published 2012-01-01
Get full text
Article -
406“...Let \(G = (V,E)\) be a graph without isolated vertices. A dominating set \(S\) of \(G\) is called a...”
Get full text
Article -
407“... of digraphs. Let D=(V,A)D=(V,A) be a digraph. A vertex subset T⊆V(D)T\subseteq V(D) is called a dominating set...”
Get full text
Article -
408“... dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two...”
Get full text
Article -
409“... domination problem in graph theory. A set S is a power dominating set of a graph G if every vertex and every...”
Get full text
Others -
410“... to only one edge of M. A paired dominating set is a vertex-set S of G such that every vertex in V − S has...”
Get full text
Others -
411by Bukhary, Nisreen“... of the hexagon lattice. A dominating set $D$ in a graph $G$ is a set of vertices such that each vertex...”
Published 2010
Get full text
Get full text
Others -
412by 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
Get full text
Others -
413“... be balanced. Our protocols work as follows: first, choose several different connected dominating sets...”
Get full text
Others -
414by Holmes, Kristin Renee Stone“... matching between the corresponding vertices of G and G̅. A set D ⊆ V (G) is a locating-dominating set of G...”
Published 2009
Get full text
Get full text
Others -
415“...碩士 === 國立交通大學 === 應用數學系所 === 105 === Let G be a graph. A set S⊆V(G) is a connected dominating set...”
Get full text
Others -
416“...A new energy efficient optimal Connected Dominating Set (CDS) algorithm with activity scheduling...”
Get full text
Article -
417“... dominating set of G, such that all vertices in G are observed by the vertices of S. Herein, a vertex observes...”
Get full text
Others -
418“...A subset D of vertices of a graph G is a dominating set if for each u ∈ V(G) ∖ D, u is adjacent...”
Get full text
Article -
419“...A subset S of V (G) is an independent dominating set of G if S is independent and each vertex of G...”
Get full text
Article -
420“... in the system can be formulated as a power dominating set problem in graph theory. The power domination number...”
Get full text
Article