Results 71 to 80 of about 5,977,266 (359)
Scattering theory and discrete-time quantum walks
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each.
Ambainis+21 more
core +1 more source
A note on co-maximal graphs of commutative rings
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
Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile+8 more
wiley +1 more source
On the hardness of recognizing triangular line graphs [PDF]
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
Phytohormone brassinosteroid‐induced gene regulation by the transcription factor BIL1/BZR1 involves redox‐dependent DNA‐binding alternation and interaction with the transcription factor PIF4. The reduced BIL1/BZR1 dimer binds preferred cis‐elements, while oxidation alters its oligomerization state and disrupts DNA‐binding ability.
Shohei Nosaki+4 more
wiley +1 more source
Mutations in the C9orf72 gene represent the most common genetic cause of amyotrophic lateral sclerosis (ALS), a fatal neurodegenerative disease. Using patient‐derived neurons and C. elegans models, we find that the nucleoporin Nup107 is dysregulated in C9orf72‐associated ALS. Conversely, reducing Nup107 levels mitigates disease‐related changes.
Saygın Bilican+7 more
wiley +1 more source
Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm [PDF]
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
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
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let
S. Arumugam, Jay S. Bagga
doaj +1 more source
Line-graph-lattice crystal structures of stoichiometric materials
The origin of many quantum-material phenomena is intimately related to the presence of flat electronic bands. In quantum simulation, such bands have been realized through line-graph lattices, a class of lattices known to exhibit flat bands. Based on that
Christie S. Chiu+3 more
doaj +1 more source