Results 81 to 90 of about 623,562 (309)

The domination number and the least $Q$-eigenvalue [PDF]

open access: yes, 2013
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all dominating sets of $
Guo, Shu-Guang   +3 more
core  

Domination inequalities and dominating graphs

open access: yesMathematical Proceedings of the Cambridge Philosophical Society
AbstractWe say that a graph H dominates another graph H′ if the number of homomorphisms from H′ to any graph G is dominated, in an appropriate sense, by the number of homomorphisms from H to G. We study the family of dominating graphs, those graphs with the property that they dominate all of their subgraphs.
Conlon, David, Lee, Joonkyung
openaire   +2 more sources

On Independence Domination [PDF]

open access: yes, 2013
Let G be a graph. The independence-domination number is the maximum over all independent sets I in G of the minimal number of vertices needed to dominate I. In this paper we investigate the computational complexity of independence domination for graphs in several graph classes related to cographs. We present an exact exponential algorithm.
Hsiang-Hsuan Liu   +4 more
openaire   +3 more sources

Novel and unscrutinized immune entities of the zebrafish gut

open access: yesFEBS Letters, EarlyView.
Understudied cells of the zebrafish immune system include bona fide immune cells and epithelial (‐derived) cells with immune functions. Research focusing on zebrafish cells which demonstrate similarities to mammalian immune cell counterparts may help us understand the pathologies in which they are implicated. Currently available and advanced tools make
Audrey Inge Schytz Andersen‐Civil   +5 more
wiley   +1 more source

Domination Cover Pebbling: Structural Results [PDF]

open access: yes, 2005
This paper continues the results of "Domination Cover Pebbling: Graph Families." An almost sharp bound for the domination cover pebbling (DCP) number for graphs G with specified diameter has been computed.
Watson, Nathaniel G., Yerger, Carl R.
core  

From lactation to malignancy: A comparison between healthy and cancerous breast gland at single‐cell resolution reveals new issues for tumorigenesis

open access: yesFEBS Letters, EarlyView.
Single‐cell RNA sequencing reveals an opposite role of SLPI in basal tumors based on metastatic spread, along with shared activation of specific regulons in cancer cells and mature luminal lactocytes, as well as downregulation of MALAT1 and NEAT1 in the latter.
Pietro Ancona   +4 more
wiley   +1 more source

Explorer les politiques de la langue et de l’infrastructure

open access: yesRevue d'anthropologie des connaissances
Analysing how journals operate is fundamental to understand how the academic world works, at a time when the impact factor has become a major sign of research quality.
Leandro Rodriguez Medina   +1 more
doaj   +1 more source

Perception, écriture et domination de l'espace maritime à travers des récits de missionnaires jésuites au XVIIe siècle

open access: yesE-Spania, 2013
Les océans ont longtemps représenté des espaces de frontière. À partir du XVIe siècle cependant, ils deviennent des vecteurs de communication et permettent de relier toutes les parties du monde entre elles et notamment Rome, alors considérée comme le ...
Delphine Tempère
doaj   +1 more source

Bounding the Porous Exponential Domination Number of Apollonian Networks [PDF]

open access: yes, 2014
Given a graph G with vertex set V, a subset S of V is a dominating set if every vertex in V is either in S or adjacent to some vertex in S. The size of a smallest dominating set is called the domination number of G.
Beverly, Joshua   +3 more
core  

Stochastic dominance, regret dominance and regret-theoretic dominance

open access: yesEURO Journal on Decision Processes, 2013
It is well known that stochastic dominance alone is insufficient for ensuring preferences when individuals experience regret. In this paper, we study two additional notions of dominance: (a) regret-theoretic dominance, which characterizes preferences in regret theory and (b) regret dominance, which characterizes preferences in mean-risk models with ...
Joseph C. Hartman, Chin Hon Tan
openaire   +2 more sources

Home - About - Disclaimer - Privacy