Results 101 to 110 of about 8,369 (289)
Perfect graphs of strong domination and independent strong domination [PDF]
, 2005 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.
D. Rautenbach, V. E. Zverovich
core
Some inequalities about connected domination number [PDF]
, 1996 Let G = (V,E) be a graph. In this note, γc, ir, γ, i, β0, Γ, IR denote the connected domination number, the irredundance number, the domination number, the independent domination number, the independence number, the upper domination number and the upper ...
Liu, Bolian, Bo, Cheng
core +1 more source
Strong Domination Index in Fuzzy Graphs
Fuzzy Information and EngineeringIn this article, a novel idea of domination degree and index are defined in a fuzzy graph (FG) using weight of strong edges. The strong domination degree (SDD) of a vertex u is defined using the weight of minimal strong dominating set (MSDS) containing u.
Kavya R. Nair +1 more
doaj +1 more source
Molecular Oncology, EarlyView.Dimethyl fumarate (DMF) reduces growth of HPV‐positive cervical cancer spheroids and induces ferroptosis in cervical cancer cells via blocking SLC7A11/Glutathione (GSH) axis. Combination of subcytotoxic doses of DMF and cisplatin (CDDP) further suppresses spheroid growth and drives cell death in 2D culture models.
Carolina Punziano +6 more
wiley +1 more source
Independent [1,2]-number versus independent domination number [PDF]
A [1, 2]-set S in a graph G is a vertex subset such that every vertex not in S has at least one and at most two neighbors in it. If the additional requirement that the set be independent is added, the existence of such sets is not guaranteed in every ...
Aleid, Sahar A. +2 more
core
On equality in an upper bound for the acyclic domination number [PDF]
Opuscula Mathematica, 2008 A subset \(A\) of vertices in a graph \(G\) is acyclic if the subgraph it induces contains no cycles. The acyclic domination number \(\gamma_a(G)\) of a graph \(G\) is the minimum cardinality of an acyclic dominating set of \(G\).
Vladimir Samodivkin
doaj
On independent domination and packing numbers of subcubic graphs
Applied Mathematics and ComputationIn a recent paper, Cho and Kim proved that in subcubic graphs, the independent domination number is at most three times the packing number. They subsequently posed the question of characterizing subcubic graphs that achieve this bound. In this paper, we completely solve the question by proving that exactly four graphs meet this bound.
Xuqing Bai +3 more
openaire +2 more sources
On upper bounds for the independent transversal domination number
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Brause +4 more
openaire +3 more sources
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source