Results 111 to 120 of about 8,369 (289)

Total and independent rainbow domination [PDF]

, 2022
V magistrskem delu predstavimo novi različici mavrične dominacije, celotno in neodvisno mavrično dominacijo. Podobno kot pri mavrični dominaciji sta tudi ti dve inačici povezani s posplošenimi prizmami $Gsquare K_k$.
Petek, Anja
core   +1 more source

Automorphisms and independent number of single nonzero component graph over a vector space

Open Mathematics
In this paper, we introduce a graph structure, called the single non-zero component graph Γ(V) ${\Gamma}\left(\mathbb{V}\right)$ , on a finite dimensional vector space V $\mathbb{V}$ .
Xi Wentao, Xie Fenghua, Zhao Jinxing, Zhang Xin   +3 more
doaj   +1 more source

New bound on MIS and MIN-CDS for a unit ball graph

ICT Express, 2017
The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number.
D.A. Mojdeh, M. Ghanbari, M. Ramezani
doaj   +1 more source

Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma

Molecular Oncology, EarlyView.
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic, Anne Nørremølle, Lilian Bomme Ousager, Lars van Brakel Andersen, Marie Louise Mølgaard Binderup, Mads Thomassen   +5 more
wiley   +1 more source

The domination parameters of cubic graphs [PDF]

, 2005
Let ir(G), γ(G), i(G), β0(G), Γ(G) and IR(G) be the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper irredundance number of a graph G, respectively.
Zverovich, Vadim, Zverovich, Igor E.
core   +1 more source

THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES [PDF]

Communications of the Korean Mathematical Society, 2003
Summary: We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.
openaire   +2 more sources

CCDC80 suppresses high‐grade serous ovarian cancer migration via negative regulation of B7‐H3

Molecular Oncology, EarlyView.
PAX8 is a lineage‐specific master regulator of transcription in high‐grade serous ovarian cancer (HGSC) progression. We show for the first time that PAX8 facilitates proliferation and metastasis by repressing the cell autonomous tumor suppressor CCDC80 and inducing B7‐H3 expression.
Aya Saleh, Nitzan Medina‐Itzhaki, Milena Chekov, Eden Gal‐Swisa, Roba Gabesh‐Wahabi, Inbar Savyon, Inna Naroditsky, Hilary A. Kenny, Basem Fares, Lina Korsensky, Einav Girsh, Liron Berger, Ruth Perets   +12 more
wiley   +1 more source

Independent domination in triangle-free graphs [PDF]

, 2008
Let G be a simple graph of order n and minimum degree δ. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G.
Haviland, Julie
core   +1 more source

KDM7A and KDM1A inhibition suppresses tumour promoting pathways in prostate cancer

Molecular Oncology, EarlyView.
Treatment resistance is a major challenge for patients with advanced prostate cancer. This study examined an alternative approach to target the major prostate cancer‐promoting pathway by targeting epigenetic factors, whose levels are higher in tumours.
Jennie N Jeyapalan, Veronika M Metzler, Simone de Brot, Corinne L Woodcock, Anna E Harris, Jennifer Lothion‐Roy, Emeli M Nilsson, Atara Ntekim, Michael S Toss, Jenny L Persson, Francesca Khani, Brian D Robinson, Lorraine J Gudas, Emad Rakha, David M Heery, Catrin S Rutland, Nigel P Mongan   +16 more
wiley   +1 more source

Weak edge-degree domination in hypergraphs [PDF]

, 1979
summary:In this paper we extend the notion of weak degree domination in graphs to hypergraphs and find relationships among the domination number, the weak edge-degree domination number, the independent domination number and the independence number of a ...
B.D. Acharya, Acharya, B.D., Gupta, Purnima, Acharya, Belmannu Devadas   +3 more
core   +1 more source