Results 91 to 100 of about 1,525,761 (361)
Generalized Schrödinger Semigroups on Infinite Graphs [PDF]
With appropriate notions of Hermitian vector bundles and connections over weighted graphs which we allow to be locally infinite, we prove Feynman–Kac-type representations for the corresponding semigroups and derive several applications thereof.
B. Güneysu, Ognjen Milatovic, F. Truc
semanticscholar +1 more source
Elevated level of cholesterol is positively correlated to prostate cancer development and disease severity. Cholesterol‐lowering drugs, such as statins, are demonstrated to inhibit prostate cancer. VNPP433‐3β interrupts multiple signaling and metabolic pathways, including cholesterol biosynthesis, AR‐mediated transcription of several oncogenes, mRNA 5′
Retheesh S. Thankan+10 more
wiley +1 more source
Spectra of the extended neighborhood corona and extended corona of two graphs
In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively.
Chandrashekar Adiga+2 more
doaj +1 more source
A sampling theory for infinite weighted graphs [PDF]
We prove two sampling theorems for infinite (countable discrete) weighted graphs \(G\); one example being "large grids of resistors" i.e., networks and systems of resistors.
Palle E. T. Jorgensen
doaj +1 more source
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Graphs of order n with fault-tolerant metric dimension n have recently been characterized.This paper points out an error in the proof of this characterization. We show that the complete multipartite graphs also have the fault-tolerant metric dimension n,
Sakander Hayat, Asad Khan, Yubin Zhong
doaj +1 more source
Infinite Graphs in Systematic Biology, with an Application to the Species Problem [PDF]
We argue that C. Darwin and more recently W. Hennig worked at times under the simplifying assumption of an eternal biosphere. So motivated, we explicitly consider the consequences which follow mathematically from this assumption, and the infinite graphs ...
S. Alexander
semanticscholar +1 more source
Infinite friendship graphs with infinite parameters
AbstractWe study infinite graphs in which every set of κ vertices has exactly λ common neighbours. We prove that there exist 2σ such graphs of each infinite order σ if κ is finite and that for κ infinite there are 2λ graphs of order λ and none of cardinality greater than λ (assuming the GCH).
E. C. Milner+2 more
openaire +2 more sources
Menger’s theorem for infinite graphs [PDF]
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of vertices separating $A$ from $B$, such that $S$ consists of a choice of precisely one vertex from each path in $\cp ...
Ron Aharoni, Eli Berger
openaire +3 more sources
This article advocates integrating temporal dynamics into cancer research. Rather than relying on static snapshots, researchers should increasingly consider adopting dynamic methods—such as live imaging, temporal omics, and liquid biopsies—to track how tumors evolve over time.
Gautier Follain+3 more
wiley +1 more source
Unordered Love in infinite directed graphs
A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source