Results 241 to 250 of about 232,778 (275)

Enslaving Minds: On Freedom of Thought and the Exploitation of Mental Vulnerabilities. [PDF]

Neuroethics
Ligthart S.
europepmc   +1 more source

Enhanced complex network influential node detection through the integration of entropy and degree metrics with node distance. [PDF]

Sci Rep
Shetty RD, M R, Shetty KR, T M.
europepmc   +1 more source

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:

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 ...
Johnson, Peter, Slater, Peter, Walsh, Matt   +2 more
openaire   +3 more sources

2-(Edge-)Connected Edge Domination Number and Matching Number

Graphs and Combinatorics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hengzhe Li, Ankang Wei, Shenggui Zhang
openaire   +2 more sources

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

TOTAL OUTER-CONNECTED DOMINATION SUBDIVISION NUMBERS IN GRAPHS

Discrete Mathematics, Algorithms and Applications, 2013
A set S of vertices of a graph G is a total outer-connected dominating set if every vertex in V(G) is adjacent to some vertex in S and the subgraph G[V\S] induced by V\S is connected. The total outer-connected domination numberγ toc (G) is the minimum size of such a set.
Favaron, O., Khoeilar, R., Sheikholeslami, S. M.   +2 more
openaire   +5 more sources

Independence number and connectivity of maximal connected domination vertex critical graphs

2023
Summary: A \(k\)-CEC graph is a graph \(G\) which has connected domination number \(\gamma_c(G) = k\) and \(\gamma_c(G + uv) < k\) for every \(uv \in E(\overline{G})\). A \(k\)-CVC graph \(G\) is a 2-connected graph with \(\gamma_c(G) = k\) and \(\gamma_c (G-v)
Almalki, Norah, Kaemawichanurat, Pawaton
openaire   +2 more sources

Radius, leaf number, connected domination number and minimum degree

Quaestiones Mathematicae, 2022
Let G be a simple, connected graph with minimum degree δ, radius r and leaf number L(G). We prove that              L(G)≥   {⅔ (r-½) (δ-2)+2 if r Ξ 2 modulo 3,                        ...
Mafuta, P., Mukwembi, S., Munyira, S.
openaire   +2 more sources

A note on connected domination number and leaf number

Discrete Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
P. Mafuta, S. Mukwembi, B.G. Rodrigues
openaire   +1 more source