Results 51 to 60 of about 1,947,729 (286)
Time after time – circadian clocks through the lens of oscillator theory
FEBS Letters, EarlyView.Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo +2 more
wiley +1 more source
A note on co-maximal graphs of commutative rings
AKCE International Journal of Graphs and Combinatorics, 2018 Let R be a commutative ring with unity. The co-maximal graph Γ ( R ) is the graph with vertex set R and two vertices a and b are adjacent if R a + R b = R .
Deepa Sinha, Anita Kumari Rao
doaj +1 more source
On the hardness of recognizing triangular line graphs [PDF]
, 2010 Given a graph G, its triangular line graph is the graph T(G) with vertex set consisting of the edges of G and adjacencies between edges that are incident in G as well as being within a common triangle.
Anand, Pranav +4 more
core +4 more sources
On hamiltonian line-graphs [PDF]
Transactions of the American Mathematical Society, 1968 Introduction. The line-graph L(G) of a nonempty graph G is the graph whose point set can be put in one-to-one correspondence with the line set of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire +1 more source
FEBS Letters, EarlyView.We identified a systemic, progressive loss of protein S‐glutathionylation—detected by nonreducing western blotting—alongside dysregulation of glutathione‐cycle enzymes in both neuronal and peripheral tissues of Taiwanese SMA mice. These alterations were partially rescued by SMN antisense oligonucleotide therapy, revealing persistent redox imbalance as ...
Sofia Vrettou, Brunhilde Wirth
wiley +1 more source
Relations between the distinguishing number and some other graph parameters [PDF]
ریاضی و جامعهA distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi +1 more
doaj +1 more source
Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm [PDF]
, 2010 We propose a new algorithm MARINLINGA for reverse line graph computation, i.e., constructing the original graph from a given line graph. Based on the completely new and simpler principle of link relabeling and endnode recognition, MARINLINGA does not ...
Liu, D. +2 more
core
Bar 1-Visibility Drawings of 1-Planar Graphs
, 2013 A bar 1-visibility drawing of a graph $G$ is a drawing of $G$ where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the ...
A.M. Dean +13 more
core +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Graphs with odd and even distances between non-cut vertices [PDF]
Opuscula MathematicaWe prove that in a connected graph, the distances between non-cut vertices are odd if and only if it is the line graph of a strong unique independence tree.
Kateryna Antoshyna, Sergiy Kozerenko
doaj +1 more source