Results 241 to 250 of about 252,155 (281)

The Association between Self-Reported Self-Disturbance Phenomena and Personal Recovery in Patients with a Schizophrenia Spectrum Disorder, Siblings, and Controls.

Psychopathology
Jelsma A, Dijkstra S, Wiemer S, Vellinga A, de Koning M, Cahn W, Simons C, van der Pluijm M, de Haan L.   +8 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

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

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
openaire   +1 more source

Triple Connected Domination Number and Strong Triple Connected Domination Number of a Connected Graph

International Journal of Mathematics Trends and Technology, 2015
The concept of connectedness plays crucial role in any meshing. A variety of connectedness has been studied in the literature by considering the existence of a path between any two vertices. A communication network in which a communicating node can send a message to two stations at one stretch will be more effective and economic.
Maneesha Sakalle, Richa Jain
openaire   +1 more source

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.
Li, Hengzhe, Yang, Yuxing, Wu, Baoyindureng   +2 more
openaire   +1 more source

Connecting domination contracts

Ethnic and Racial Studies, 2017
In Black Rights/White Wrongs, Charles Mills continues his critique of contemporary American political philosophy for ignoring issues of racial oppression, and in particular for ignoring the way tha...
openaire   +1 more source

Connected Total Dominating Sets and Connected Total Domination Polynomials of Square of Paths

International Journal of Mathematics Trends and Technology, 2014
Let G be a simple connected graph of order n. Let Dct(G, i) be the family of connected total dominating sets in G with cardinality i. The polynomial Dct (G, x) = n i (G) ct    dct (G, i) x is called the connected total domination polynomial of G. In this paper, we obtain a recursive formula for dct ( 2 n P , i).
A Vijayan, T. Anitha Baby
openaire   +1 more source

Outer-connected domination in 2-connected cubic graphs

Discrete Mathematics, Algorithms and Applications, 2014
A set S of vertices of a graph G is an outer-connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by V\S is connected. The outer-connected domination number [Formula: see text] is the minimum size of such a set.
Wang, Shipeng, Wu, Baoyindureng, An, Xinhui, Liu, Xiaoping, Deng, Xingchao   +4 more
openaire   +2 more sources

Connected Domination

2020
Mustapha Chellali, Odile Favaron
openaire   +1 more source