Results 51 to 60 of about 1,131,018 (144)

Negative Signed Domination in Digraphs

open access: yes, 2011
The Concept of Negative Signed Domination Number of a Directed Graph Is Introduced. Exact Values Are Found for the Directed Cycle and Particular Types of Tournaments. Furthermore, it Is Proved that the Negative Signed Domination Number May Be Arbitrarily
Wen Sheng Li
core   +1 more source

Cognitive functions and patterns of brain activity in patients after simultaneous coronary and carotid artery revascularization. [PDF]

open access: yesFront Hum Neurosci, 2023
Tarasova I   +8 more
europepmc   +1 more source

Double Roman Domination

open access: yes, 2016
For a graph G=(V,E), a double Roman dominating function is a function f:V→{0,1,2,3} having the property that if f(v)=0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor with f(w)=3, and if f(v)=1, then vertex v must have ...
Haynes, Teresa W.   +2 more
core   +1 more source

Anarchism and non-domination [PDF]

open access: yes, 2019
In this article we recover the classical anarchist deployment of republican tropes of non-domination, tyranny and slavery, to expose the conservative limits of the contemporary neo-Roman republican revival. For the anarchists, the modern nation state and
WAL Prichard (21872402)   +1 more
core   +1 more source

Prospective Tracking of Donor-Reactive T-Cell Clones in the Circulation and Rejecting Human Kidney Allografts. [PDF]

open access: yesFront Immunol, 2021
Aschauer C   +19 more
europepmc   +1 more source

Medico-legal and ethical issues in anaesthesiology profession. [PDF]

open access: yesIndian J Anaesth, 2021
Shinde SS   +4 more
europepmc   +1 more source

The Signed Roman Domination Number of Ladder graphs, circular Ladder graphs and their complements [PDF]

open access: yes
Let $G=(V,E)$ be a finite connected simple graph with vertex set $V$ and edge set $E$. A signed Roman dominating function (SRDF) on a graph $G$ is a function $f: V \rightarrow \{-1, 1, 2\}$ that satisfies two conditions: (i) $\sum_{y\in N[x]} f(y)\geq1 ...
Ahmed, Delbrin   +3 more
core  

The Signed Total Mixed Roman Domination Numbers of Graphs

open access: yesJournal of Physics: Conference Series
Abstract The problem of signed domination of graphs is a typical optimization problem. It requires that each vertex and edge be assigned a feasible label so that the sum of assigned labels is minimized. First, we propose the concept of a signed total mixed Roman domination number and introduce the related research progress.
Xia Hong, Li Zhang, Xiaobing Guo
openaire   +1 more source

Home - About - Disclaimer - Privacy