Results 71 to 80 of about 1,525,761 (361)
Self‐adjoint and Markovian extensions of infinite quantum graphs [PDF]
We investigate the relationship between one of the classical notions of boundaries for infinite graphs, graph ends, and self‐adjoint extensions of the minimal Kirchhoff Laplacian on a metric graph.
A. Kostenko+2 more
semanticscholar +1 more source
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (
Vijayakumar Gurusamy Rengasamy
doaj +1 more source
AbstractA theorem is established that provides necessary and sufficient conditions in order that a locally finite bipartite graph have a subgraph whose valences lie in prescribed intervals. This theorem is applied to the study of flows in locally finite directed graphs.
Jon Folkman, D.R. Fulkerson
openaire +2 more sources
The Distinguishing Index of Infinite Graphs
The distinguishing index $D^\prime(G)$ of a graph $G$ is the least cardinal $d$ such that $G$ has an edge colouring with $d$ colours that is only preserved by the trivial automorphism. This is similar to the notion of the distinguishing number $D(G)$ of
I. Broere, M. Pilsniak
semanticscholar +1 more source
The power of microRNA regulation—insights into immunity and metabolism
MicroRNAs are emerging as crucial regulators at the intersection of metabolism and immunity. This review examines how miRNAs coordinate glucose and lipid metabolism while simultaneously modulating T‐cell development and immune responses. Moreover, it highlights how cutting‐edge artificial intelligence applications can identify miRNA biomarkers ...
Stefania Oliveto+2 more
wiley +1 more source
Distinguishability of Infinite Groups and Graphs [PDF]
The distinguishing number of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the distinguishing number of its automorphism group acting on its vertex set. A connected graph $\Gamma$ is
Simon Smith+2 more
openaire +4 more sources
Disruption of SETD3‐mediated histidine‐73 methylation by the BWCFF‐associated β‐actin G74S mutation
The β‐actin G74S mutation causes altered interaction of actin with SETD3, reducing histidine‐73 methylation efficiency and forming two distinct actin variants. The variable ratio of these variants across cell types and developmental stages contributes to tissue‐specific phenotypical changes. This imbalance may impair actin dynamics and mechanosensitive
Anja Marquardt+8 more
wiley +1 more source
Subshifts on Infinite Alphabets and Their Entropy
We analyze symbolic dynamics to infinite alphabets by endowing the alphabet with the cofinite topology. The topological entropy is shown to be equal to the supremum of the growth rate of the complexity function with respect to finite subalphabets.
Sharwin Rezagholi
doaj +1 more source
On Laplacian Equienergetic Signed Graphs
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal.
Qingyun Tao, Lixin Tao
doaj +1 more source
This study reveals how prime editing guide RNA (pegRNA) secondary structure and reverse transcriptase template length affect prime editing efficiency in correcting the phospholamban R14del cardiomyopathy‐associated mutation. Insights support the design of structurally optimized enhanced pegRNAs for precise gene therapy.
Bing Yao+7 more
wiley +1 more source