Results 141 to 150 of about 4,129,862 (348)

Existence of Regular Nut Graphs for Degree at Most 11

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W.   +4 more
doaj   +1 more source

Regular graphs with four eigenvalues [PDF]

open access: yes
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core  

Hyperosmotic stress‐induced redistribution of pre‐mRNA cleavage factor I subunits is associated with shifts in alternative polyadenylation

open access: yesFEBS Open Bio, EarlyView.
Hyperosmotic stress triggers the relocation of the CFIm complex from the nucleus to the cytoplasm. This shift creates a nuclear ‘stoichiometric bottleneck’, limiting CFIm availability for mRNA processing. Consequently, specific mRNAs like NUDT21 and DICER1 undergo targeted 3′UTR shortening, demonstrating how spatial protein dynamics drive rapid ...
Hitomi Soumiya   +2 more
wiley   +1 more source

Classification of graphs by regularity

open access: yesJournal of Combinatorial Theory, Series B, 1981
AbstractWe give a classification of graphs by two parameters s and t such that a graph is regular iff t ≥ 2, edge-regular iff t ≥ 3, and distance regular of diameter δ iff s = δ, t ≥ 2δ − 2. We investigate the algebra of polynomials in the adjacency matrix and relate to every graph a family of orthogonal polynomials. This generalizes various results on
openaire   +3 more sources

Developments on Spectral Characterizations of Graphs [PDF]

open access: yes
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core  

Evaluating the involvement of autolysosomes in the nuclear translocation of fluorescent proteins

open access: yesFEBS Open Bio, EarlyView.
Endogenously expressed fluorescent proteins can be degraded by autophagy and transported to cell nuclei via the nuclear pore complex. But in some cell lines, for example, HeLa cells which are positive for immunoreactivity of a receptor ligand, such as UCN I, in cell nuclei, fusion of autolysosome with the nuclear envelope is involved in the nuclear ...
Keiichi Ikeda
wiley   +1 more source

REGULAR PARTIAL DOMATIC NUMBER ON ANTI FUZZY GRAPHS [PDF]

open access: yesJournal of Mechanics of Continua and Mathematical Sciences
AG = (N, A, σ, μ) be a anti fuzzy graph. A partition of N(AG) Π = {D1, D2, …., Dk} is a regular anti fuzzy partial domatic partition of AG if (i) for each Di, < Di > is an anti fuzzy regular and (ii) Di is an anti fuzzy dominating set of GA.
Rengasamy Muthuraj   +2 more
doaj   +1 more source

Treatment with KCL‐286, a first‐in‐class retinoic acid receptor‐β (RARβ) agonist, ameliorates neuronal DNA damage and inflammation in a mouse model of Alzheimer's disease

open access: yesFEBS Open Bio, EarlyView.
Repair of neuronal DNA damage in Alzheimer's disease by KCL‐286. (A) Amyloid‐β oligomers and plaques impair neuronal DNA repair pathways, leading to DNA double‐strand breaks and glial activation. (B) KCL‐286 activates RARβ/RXR signalling via retinoic acid response elements (RAREs), associated with increased BRCA1 expression, enhanced DNA repair and ...
Natasha Hill   +6 more
wiley   +1 more source

Graphs with regular monoids

open access: yesDiscrete Mathematics, 2003
The author proves that the endomorphism monoid of \(\overline{C_n}\) \((n\geq 3)\) is regular where \(\overline{C_n}\) denotes the complement graph of a undirected cycle of \(n\) vertices. It is noted that \(\text{End}(\overline{C_6})\) is not an orthodox monoid.
openaire   +2 more sources

Average tree solutions for graph games [PDF]

open access: yes
In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and ...
Remila, Eric   +3 more
core  

Home - About - Disclaimer - Privacy