Results 261 to 270 of about 11,106,432 (291)

The Double Dominion Over Women's Bodies as a barrier to exercising sexual and reproductive rights: a mixed-methods study in La Ladrillera, Mexico. [PDF]

Lancet Reg Health Am
Bejarano Zambrano CL, Gilbert H, González Palacios CA, Mukherjee J, Bejarano Zambrano MF, Kasmani MN, Knipper M.   +6 more
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:

A characterization of trees with equal independent domination and secure domination numbers

Information Processing Letters, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zepeng Li
exaly   +2 more sources

Independent transversal domination number in complementary prisms

, 2021
Summary: A set \(D \subseteq V(G)\) is an independent transversal dominating set of \(G\) if \(D\) is a dominating set and also intersects every maximum independent set in \(G\). The minimum cardinality of such a set is equal to the transversal domination number, denoted by \(\gamma_\mathrm{it}(G)\).
Aytac, Aysun, Erkal, Cem
openaire   +4 more sources

Trees with independent Roman domination number twice the independent domination number

Discrete Mathematics, Algorithms and Applications, 2015
A Roman dominating function (RDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the condition that every vertex [Formula: see text] for which [Formula: see text] is adjacent to at least one vertex [Formula: see text] for which [Formula: see text].
Mustapha Chellali, Nader Jafari Rad
openaire   +2 more sources

On Domination and Independence Numbers of Graphs

Results in Mathematics, 1990
The authors characterize those graphs which (1) have equal domination and independence numbers, and (2) are either bipartite or are block graphs, i.e., graphs in which every block is a complete graph.
Topp, Jerzy, Volkmann, Lutz
openaire   +1 more source

Perfect graphs of strong domination and independent strong domination [PDF]

Discrete Mathematics, 2001
Let γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively.
Dieter Rautenbach
exaly   +2 more sources

Domination critical graphs with higher independent domination numbers

Journal of Graph Theory, 1996
Let \(\gamma(G)\) be the domination number of a graph \(G\) and denote by \(i(G)\) its independent domination number. We say that a graph \(G\) is domination critical, if for every edge \(e\in \overline E(G)\), we have \(\gamma(G+ e)< \gamma(G)\). Obviously, \(\gamma(G)\leq i(G)\). It was conjectured that if \(G\) is a domination critical graph with \(\
S. Ao, Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt   +3 more
openaire   +3 more sources

Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suil O, Douglas B. West
openaire   +3 more sources

The domination and independent domination numbers of some families of snarks

Ars Mathematica Contemporanea
It is known that for an arbitrary graph \(G\), determining either its domination number \(\gamma(G)\) or independent domination number \(i(G)\) is an NP-hard problem. Therefore, establishing bounds for and determining these two domination parameters for particular classes of graphs (especially for cubic graphs) received much attention.
Alessandra A. Pereira, Christiane Neme Campos   +1 more
openaire   +3 more sources