Results 81 to 90 of about 1,555,658 (364)

Resolvent of Large Random Graphs

open access: yes, 2009
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such ...
Aldous   +31 more
core   +4 more sources

The Distinguishing Index of Infinite Graphs

open access: yesElectronic Journal of Combinatorics, 2015
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

Reconstruction of infinite graphs

open access: yesDiscrete Mathematics, 1991
The paper surveys results concerning reconstruction and edge- reconstructon of infinite graphs and draws attention to several interesting unsolved problems.
openaire   +3 more sources

RAD50 missense variants differentially affect the DNA damage response and mitotic progression

open access: yesFEBS Letters, EarlyView.
RAD50 incorporates into the MRN complex and initiates the DNA damage response. Furthermore, RAD50 promotes mitotic progression. RAD50 missense variants capable of forming an MRN complex supported the DNA damage response and mitotic features to different extents in complementation experiments, indicating these functions are separable and might impact ...
Hanna Redeker   +9 more
wiley   +1 more source

Subshifts on Infinite Alphabets and Their Entropy

open access: yesEntropy, 2020
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

Infinite triangulated graphs

open access: yesDiscrete Mathematics, 1978
AbstractWe strengthen a theorem of W.T. Trotter relating α-imperfect graphs to Suslin trees and derive several new results for infinite graphs with no chordless 4-cycles. We show that for such graphs G, (1) if G is χ-perfect then G is α-perfect, and (2) ΘG is at most the first cardinal beyond αG. We also indicate how Martin's axiom can be used to prove
openaire   +3 more sources

Plasmodium falciparum gametogenesis essential protein 1 (GEP1) is a transmission‐blocking target

open access: yesFEBS Letters, EarlyView.
This study shows Plasmodium falciparum GEP1 is vital for activating sexual stages of malarial parasites even independently of a mosquito factor. Knockout parasites completely fail gamete formation even when a phosphodiesterase inhibitor is added. Two single‐nucleotide polymorphisms (V241L and S263P) are found in 12%–20% of field samples.
Frederik Huppertz   +5 more
wiley   +1 more source

Ising spin glass models versus Ising models: an effective mapping at high temperature III. Rigorous formulation and detailed proof for general graphs

open access: yes, 2007
Recently, it has been shown that, when the dimension of a graph turns out to be infinite dimensional in a broad sense, the upper critical surface and the corresponding critical behavior of an arbitrary Ising spin glass model defined over such a graph ...
Baxter R J   +13 more
core   +1 more source

Chemoresistome mapping in individual breast cancer patients unravels diversity in dynamic transcriptional adaptation

open access: yesMolecular Oncology, EarlyView.
This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani   +14 more
wiley   +1 more source

Pair L(2, 1)-Labelings of Infinite Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2019
An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This
Yeh Roger K.
doaj   +1 more source

Home - About - Disclaimer - Privacy