Results 71 to 80 of about 3,157 (213)
ZERO FORCING NUMBER AND MAXIMUM NULLITY OF GENERAL POWER GRAPHS [PDF]
Journal of Algebraic SystemsLet Γ = (V,E) be a simple and undirected graph. General power graph of Γ, shown by Pg(Γ), is a graph with the vertex set P(V (Γ))\ϕ. Also two distinct vertices of B and C are adjacent if and only if every b ∈ B is adjacent to every c ∈ C \{b} in Γ.
Fateme Kheiridosst, Ebrahim Vatandoost
doaj +1 more source
On the difference graph of power graphs of finite groups
Quaestiones Mathematicae, 2023 2 ...
Kumar, Jitender +2 more
openaire +3 more sources
FEBS Letters, EarlyView.Cancer progression is regulated by the dynamic matrix code of the tumor microenvironment, which influences cellular behavior and disease development. Importantly, matrix remodeling in three‐dimensional cancer models more accurately reflects in vivo conditions compared to conventional two‐dimensional systems.
Sylvia Mangani +3 more
wiley +1 more source
On the Extended Adjacency Eigenvalues of Graphs and Applications
MathematicsLet Aex(G) be the extended adjacency matrix of G. The eigenvalues of Aex(G) are called extended adjacency eigenvalues of G. The sum of the absolute values of eigenvalues of the Aex-matrix is called the extended adjacency energy Eex(G) of G. In this paper,
Hilal A. Ganie, Amal Alsaluli
doaj +1 more source
Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential
FEBS Letters, EarlyView.Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta +3 more
wiley +1 more source
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
Journal of Mathematics, 2023 A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges ...
C. M. Barasara, Y. B. Thakkar
doaj +1 more source
Between the enhanced power graph and the commuting graph
Journal of Graph Theory, 2022 AbstractThe purpose of this note is to define a graph whose vertex set is a finite group , whose edge set is contained in that of the commuting graph of and contains the enhanced power graph of . We call this graph the deep commuting graph of . Two elements of are joined in the deep commuting graph if and only if their inverse images in every central ...
Peter J. Cameron, Bojan Kuzma
openaire +4 more sources
The role of miR‐335‐5p in the redifferentiation of BRAF p.V600E thyroid cancers
Molecular Oncology, EarlyView.The BRAF p.V600E mutation promotes thyroid cancer dedifferentiation and radioiodine resistance. Using a network approach, we identified miR‐335‐5p as a key regulator of BRAF‐mutated thyroid tumors. Restoring miR‐335‐5p increased thyroid‐specific gene expression and iodine uptake in cells and organoids.
Valeria Pecce +11 more
wiley +1 more source
Power domination in maximal planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Power domination in graphs emerged from the problem of monitoring an electrical system by placing as few measurement devices in the system as possible. It corresponds to a variant of domination that includes the possibility of propagation.
Paul Dorbec +2 more
doaj +1 more source
SOME GRAPH PARAMETERS OF POWER SET GRAPHS
Advances and Applications in Discrete Mathematics, 2021 In this study, we examine some graph parameters such as the edge number, chromatic number, girth, domination number and clique number of power set graphs.
Cangül, İsmail Naci +3 more
openaire +2 more sources