Results 81 to 90 of about 1,525,761 (361)
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs [PDF]
Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems.
Rayna Dimitrova, Rupak Majumdar
doaj +1 more source
On the spectrum of an infinite graph
AbstractWe exhibit an example of an infinite locally finite graph such that its adjacency operator is not self-adjoint. This gives a negative answer to a conjecture of Mohar [1].
openaire +2 more sources
Circulating tumor DNA (ctDNA) offers a possibility for different applications in early and late stage breast cancer management. In early breast cancer tumor informed approaches are increasingly used for detecting molecular residual disease (MRD) and early recurrence. In advanced stage, ctDNA provides a possibility for monitoring disease progression and
Eva Valentina Klocker+14 more
wiley +1 more source
Cycle Double Covers of Infinite Planar Graphs
In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.
Javaheri Mohammad
doaj +1 more source
On the distance spectrum of certain distance biregular graphs
In this article we present an infinite family of bipartite distance biregular graphs having an arbitrarily large diameter and whose distance matrices have exactly four distinct eigenvalues. This result answers a question posed by F.
Miriam Abdon+2 more
doaj +1 more source
Spectral Theory of Infinite Quantum Graphs [PDF]
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection
P. Exner+3 more
semanticscholar +1 more source
The spectrum of an infinite graph
AbstractThe spectrum of a locally finite countable graph is defined. Some theorems known from the theory of spectra of finite graphs are extended to infinite graphs.
openaire +2 more sources
The Colouring Number of Infinite Graphs [PDF]
We show that, given an infinite cardinal $ $, a graph has colouring number at most $ $ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its vertices that simultaneously witnesses its colouring number and its cardinality.
Johannes Carmesin+3 more
openaire +3 more sources
This study investigates an alternative approach to reactivating the oncosuppressor p53 in cancer. A short peptide targeting the association of the two p53 inhibitors, MDM2 and MDM4, induces an otherwise therapeutically active p53 with unique features that promote cell death and potentially reduce toxicity towards proliferating nontumor cells.
Sonia Valentini+10 more
wiley +1 more source
Pair L(2, 1)-Labelings of Infinite Graphs
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