Results 251 to 260 of about 1,217,256 (282)

Honouring complexity and social justice in mental health: The socio-political economy of global mental health framework. [PDF]

PLOS Ment Health
Burgess RA, Ní Chobhthaigh S, Biswal B, Iemmi V, Ceccolini D, Fadipe B, Lund C, Pathare S.   +7 more
europepmc   +1 more source

Toward a humanized technology: a reinterpretation of Erich Fromm' s humanistic peace psychology. [PDF]

Front Psychol
Wang Y, Li P, Liu W.
europepmc   +1 more source

From Attachment Trauma to Traumatic Attachment: Invisible Injuries of Early Childhood and Subtle Relational Codes of Self-Regulation. [PDF]

Clin Neuropsychiatry
Şar V.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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
exaly   +2 more sources

The connected hub number and the connected domination number

Networks, 2011
AbstractThe connected hub number hc(G) of a connected graph G is the smallest order of a connected subgraph H of G such that any two nonadjacent vertices of G − H are joined in G by a path with all internal vertices in H. Letting γc(G) denote the connected domination number of G, it is easy to see that hc(G) ≤ γc(G) ≤ hc(G) + 1 for every connected ...
Peter D. Johnson Jr., Peter Slater, Matt Walsh 0001   +2 more
exaly   +3 more sources

Total outer-connected domination numbers of trees [PDF]

Discrete Applied Mathematics, 2009
Let G=(V,E) be a graph without an isolated vertex. A set D⊆V(G) is a total dominating set if D is dominating, and the induced subgraph G[D] does not contain an isolated vertex.
Joanna Cyman, Joanna Raczek
exaly   +2 more sources

On graphs for which the connected domination number is at most the total domination number [PDF]

Discrete Applied Mathematics, 2012
In this note, we give a finite forbidden subgraph characterization of the connected graphs for which any non-trivial connected induced subgraph has the property that the connected domination number is at most the total domination number. This question is
Oliver Schaudt
exaly   +2 more sources

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