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
-
441by Frank A. Hernández Mira, Ernesto Parra Inza, José M. Sigarreta Almira, Nodari Vakhania“...></inline-formula> is a dominating set if every vertex of this graph is adjacent to at least one vertex from...”
Published 2021-02-01
Get full text
Article -
442“... dominating set (CDS) of graph theory. However, generating the virtual backbone by using the CDS algorithm...”
Get full text
Article -
443by Magda Dettlaff, Magdalena Lemańska, Jerzy Topp, Radosław Ziemann, Paweł Żyliński“... of certified domination that models the aforementioned problem. Specifically, a dominating set of a graph...”
Published 2020-01-01
Get full text
Article -
444“... V\) is a weak (strong, respectively) dominating set of \(G\) if every vertex \(v \in V...”
Get full text
Article -
445“... condition. In section 3, we discuss an upper bound of geodetic numbers of cographs. A 2-N-dominating set...”
Get full text
Others -
446“...\subseteq V(G) is a kk-dominating set if every vertex outside DD is adjacent to at least kk vertices in DD...”
Get full text
Article -
447“...A set S of vertices in a graph G is an independent dominating set of G if S is an independent set...”
Get full text
Article -
448“... will be conserved. In this thesis, we proposed to use the connected dominating set (CDS) as the routing path...”
Get full text
Others -
449“... function f from V to N, a dominating set D(subset of V) is fault tolerant if | D∩N[v] | >= f(v) for all v...”
Get full text
Others -
450“... subset of a simple undirected graph is called dominating set if every vertex of the given graph is either...”
Get full text
Article -
451by Samuel, Hany“... architecture. We introduce the concept of virtual network topology and redefine the dominating-set based...”
Published 2011
Get full text
-
452by Samuel, Hany“... architecture. We introduce the concept of virtual network topology and redefine the dominating-set based...”
Published 2011
Get full text
-
453by Zehui Shao, Saeed Kosari, Mustapha Chellali, Seyed Mahmoud Sheikholeslami, Marzieh Soroudi“...A <i>dominating set</i> in a graph <i>G</i> is a set of vertices <inline-formula> <math display...”
Published 2020-06-01
Get full text
Article -
454“.... A vertex subset D is a double total dominating set of G if every vertex of G is adjacent to at least...”
Get full text
Others -
455by Deering, Jessie“... also give a polynomial time algorithm to find a minimum downhill dominating set and a minimum uphill...”
Published 2013
Get full text
Get full text
Others -
456“...], respectively. A set D is a dominating set of a graph G if every vertex in V\D is adjacent to at least one...”
Get full text
Others -
457by Włodzimierz Ulatowski“...In this paper we continue the study of paired-domination in graphs. A paired-dominating set...”
Published 2015-01-01
Get full text
Article -
458“...A vertex subset S of a digraph D is called a dominating set of D if every vertex...”
Get full text
Article -
459by Sacrest Gascon, Aleix“... are used as benchmarks encoding problems about graph theory (dominating set, even colouring and vertex...”
Published 2017
Get full text
Others -
460