Results 101 to 110 of about 7,194,939 (348)

A NOT ON DOMINATING SET WITH MAPLE [PDF]

Journal of Nonlinear Sciences and Applications, 2008
Let G be a n− vertex graph. In 1996, Reed conjectured that γ(G) ≤ dn/3e for every connected 3− regular G. In this paper, we introduce an algorithm in computer algebra system of MAPLE such that, by using any graph as input, we can calculate domination number γ(G) and illustrated set of all dominating sets.
M. Matinfar, S. Mirzamani
openaire   +2 more sources

A stepwise emergence of evolution in the RNA world

FEBS Letters, EarlyView.
How did biological evolution emerge from chemical reactions? This perspective proposes a gradual scenario of self‐organization among RNA molecules, where catalytic feedback on random mixtures plays the central role. Short oligomers cross‐ligate, and self‐assembly enables heritable variations. An event of template‐externalization marks the transition to
Philippe Nghe
wiley   +1 more source

X− Dominating colour transversals in graphs

Boletim da Sociedade Paranaense de Matemática, 2016
Let G = (X, Y,E) be a bipartite graph. A X-dominating set D ⊆ X is called a X−dominating colour transversal set of a graph G if D is a transversal of at least one $chi$−partition of G.The minimum cardinal- ity of a X−dominating colour transversal set is ...
Venkatakrishnan Balasubramanian Yanamandram, C. Natarajan, S. K. Ayyaswamy   +2 more
doaj   +1 more source

On global location-domination in graphs [PDF]

, 2013
A dominating set $S$ of a graph $G$ is called locating-dominating, LD-set for short, if every vertex $v$ not in $S$ is uniquely determined by the set of neighbors of $v$ belonging to $S$.
Hernando, C., Mora, M., Pelayo, I. M.
core   +1 more source

The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation

, 2015
A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set. We solve this hard combinatorial optimization problem approximately by a
C Pang, F Molnár Jr, FR Kschischang, G Gutin, HJ Zhou, J Leskovec, JH Zhao, JQ Xiao, M Bauer, M Garey, M Mézard, M Mézard, M Mézard, M Richardson, M Ripeanu, S Wuchty, T Takaguchi, TW Haynes, Y Fu, Y Yang, YY Liu, YY Liu   +21 more
core   +1 more source

Disjoint dominating and total dominating sets in graphs

Discrete Applied Mathematics, 2010
AbstractIt has been shown [M.A. Henning, J. Southey, A note on graphs with disjoint dominating and total dominating sets, Ars Combin. 89 (2008) 159–162] that every connected graph with minimum degree at least two that is not a cycle on five vertices has a dominating set D and a total dominating set T which are disjoint.
Christian Löwenstein, Dieter Rautenbach, Justin Southey, Michael A. Henning   +3 more
openaire   +2 more sources

B cell mechanobiology in health and disease: emerging techniques and insights into therapeutic responses

FEBS Letters, EarlyView.
B cells sense external mechanical forces and convert them into biochemical signals through mechanotransduction. Understanding how malignant B cells respond to physical stimuli represents a groundbreaking area of research. This review examines the key mechano‐related molecules and pathways in B lymphocytes, highlights the most relevant techniques to ...
Marta Sampietro, Marco Cellani, Cristina Scielzo   +2 more
wiley   +1 more source

Graphs with disjoint dominating and paired-dominating sets [PDF]

Open Mathematics, 2010
Abstract A dominating set of a graph is a set of vertices such that every vertex not in the set is adjacent to a vertex in the set, while a paired-dominating set of a graph is a dominating set such that the subgraph induced by the dominating set contains a perfect matching.
Michael A. Henning, Justin Southey
openaire   +2 more sources

Evolutionary interplay between viruses and R‐loops

FEBS Letters, EarlyView.
Viruses interact with specialized nucleic acid structures called R‐loops to influence host transcription, epigenetic states, latency, and immune evasion. This Perspective examines the roles of R‐loops in viral replication, integration, and silencing, and how viruses co‐opt or avoid these structures.
Zsolt Karányi, Zita Képes, Zoltán Szabó, Eszter Csoma, Lóránt Székvölgyi   +4 more
wiley   +1 more source

Independent point-set dominating sets in graphs

AKCE International Journal of Graphs and Combinatorics, 2020
In this paper, we study graphs which possess an independent point-set dominating set (in short, ipsd-set). We call such a graph as an ipsd-graph. We first provide general structural characterization of separable ipsd-graphs and thereafter, in our quest ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj   +1 more source