Results 261 to 270 of about 7,398 (287)

Reciprocal effects between post-migration risk factors for mental health and barriers to access to treatment among refugees and asylum seekers: what have we learnt? [PDF]

Front Psychiatry
Bartolomei J, Reyre A.
europepmc   +1 more source

Connected power domination in graphs [PDF]

Journal of Combinatorial Optimization, 2019
The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from which every vertex in the graph can be observed, following a set of rules for power system monitoring. In this paper,
Boris Brimkov, Derek Mikesell, Logan A Smith   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

2-Edge connected dominating sets and 2-Connected dominating sets of a graph

Journal of Combinatorial Optimization, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li, Yuxing Yang, Baoyindureng Wu
openaire   +1 more source

Connected dominating sets and connected domination polynomials of square of centipedes

Journal of Information and Optimization Sciences, 2016
AbstractLet G be a simple connected graph. The connected domination polynomial of G is defined by , where γd(G) is the connected domination number of G. In this paper, we find the connected dominating sets of and a recursive formula is obtained. Also, we construct the connected domination polynomial of and some interesting properties between the ...
A. Vijayan, M. Felix Nes Mabel
exaly   +2 more sources

CONNECTED SUPER DOMINATION IN GRAPHS

Advances and Applications in Discrete Mathematics, 2018
Summary: Let \(G\) be a simple graph. A set \(S\subseteq V(G)\) is a connected super dominating set if for every \(v\in V(G)\backslash S\), there exists an external private neighbor of \(v\) with respect to \(S\) and the subgraph \(\langle S\rangle\) induced by \(S\) is connected. The connected super domination number of \(G\), denoted by \(\gamma_{csp}
Liguarda, Remilou F., Canoy, Sergio R. jun.   +1 more
openaire   +2 more sources

On the outer-connected domination in graphs

Journal of Combinatorial Optimization, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mohammad Hadi Akhbari, Roslan Hasni, Odile Favaron, Hossein Karami 0002, Seyed Mahmoud Sheikholeslami   +4 more
openaire   +2 more sources

Connected monophonic domination in graphs

Discrete Mathematics, Algorithms and Applications, 2020
A collection of vertices in different connected graphs embraces a wholesome shift into a new collection with the properties of the couplets monophonic and dominating sets. The new collection of vertices and associated invariant with the new behavior of connected graphs are called as connected monophonic dominating set (cmd-set) and connected ...
A. Sadiquali, P. Arul Paul Sudhahar, V. Lakshmana Gomathi Nayagam   +2 more
openaire   +2 more sources

Total and connected domination in digraphs [PDF]

Australas. J Comb., 2007
Summary: Let \(D= (V,A)\) be a digraph. A subset \(S\) of \(V\) is called a dominating set of \(D\) if for every vertex \(v\in V- S\), there exists a vertex \(u\in S\) such that \((u,v)\in A\). A dominating set \(S\) is called a total dominating set if the induced subdigraph \(\langle S\rangle\) has no isolated vertices. It is called an open dominating
S. Arumugam 0001, K. Jacob, Lutz Volkmann   +2 more
openaire   +1 more source

Domination and Outer Connected Domination in Maximal Outerplanar Graphs

Graphs and Combinatorics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources