Results 81 to 90 of about 252,358 (178)

On the global offensive alliance in unicycle graphs

AKCE International Journal of Graphs and Combinatorics, 2018
For a graph , a set is a dominating set if every vertex in has at least a neighbor in . A dominating set is a global offensive alliance if for each vertex in at least half the vertices from the closed neighborhood of are in The domination number is the ...
Mohamed Bouzefrane, Saliha Ouatiki
doaj   +1 more source

Secure monophonic domination of graphs [PDF]

Journal of Hyperstructures
Let G = (V, E) be a connected graph. A monophonic dominating set M is said to be a secure monophonic dominating set Sm (abbreviated as SMD set) of G if for each v∈V \M there exists u∈M such that v is adjacent to u and Sm = {M \(u)} ∪{v} is a monophonic ...
K Sunitha, D Divya
doaj   +1 more source

Connected Point Set Domination of Fuzzy Graphs

International Journal of Mathematics and Soft Computing, 2012
Let  be a fuzzy Graph. Let  denote respectively the domination number, the point set domination number and the connected point set domination number of a fuzzy graph. A dominating set D of a fuzzy graph is said to be a point set dominating set of a fuzzy graph if for every  there exists a node  such that  is connected fuzzy graph.
J. S. Sathya, S. Vimala
openaire   +1 more source

Injective Eccentric Domination in Graphs

مجلة بغداد للعلوم
The concept of domination has inspired researchers which has contributed to a vast literature on domination. A subset  of  is said to be a dominating set, if every vertex not in  is adjacent to at least one vertex in .
Riyaz Ur Rehman A, A Mohamed Ismayil
doaj   +1 more source

Dominating number of distance two of corona products of graphs

Indonesian Journal of Combinatorics, 2016
Dominating set $S$ in graph $G=(V,E)$ is a subset of $V(G)$ such that every vertex of $G$ which is not element of $S$ are connected and have distance one to $S$.
Reni Umilasari, Darmaji Darmaji
doaj  

Improved Location Estimation in Wireless Sensor Networks Using a Vector-Based Swarm Optimized Connected Dominating Set. [PDF]

Sensors (Basel), 2019
Kumar G, Saha R, Rai MK, Thomas R, Kim TH, Lim SJ, Singh JSP.   +6 more
europepmc   +1 more source

Connected Dominating Set & Related Problems

, 2019
Ερευνούμε δύο εκδοχές του προβλήματος του Συνδεδεμένου Κυρίαρχου Συνόλου (ΣΚΣ), τα προβλήματα του Μερικώς Συνδεδεμένου Κυρίαρχου Συνόλου (ΜΣΚΣ) και του Μπάτζετ Συνδεδεμένου Κυρίαρχου Συνόλου (ΠΣΚΣ). Ερευνούμε επίσης τρία ακόμη προβλήματα, χαλαρά ή στενά συσχετισμένα με το ΣΚΣ, τα οποία είναι: Τα προβλήματα του Γαλαξιακού Κοντινότερου Μονοπατιού, του ...
Mantas Anastasios, Yfantis Filippos
openaire   +1 more source

A Local Search Algorithm with Vertex Weighting Strategy and Two-Level Configuration Checking for the Minimum Connected Dominating Set Problem. [PDF]

Biomimetics (Basel)
Li R, He J, Liu S, Hu S, Yin M.
europepmc   +1 more source

Connected dominating sets and a new graph invariant

Computer Science Journal of Moldova, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Exploring the properties of benzenoid hydrocarbons through QSPR modeling and domination-based energy parameters. [PDF]

Sci Rep
Sankaran S, Chidambaram N.
europepmc   +1 more source