Results 91 to 100 of about 1,555,658 (364)
Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 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
Discrete Mathematics, 1975 AbstractSome relations between the number of nodes and edges and the degrees of the nodes in infinite graphs are obtained. The structure of infinite connected graphs which have no- ∞ trails is investigated with the help of these. It is shown, for example, that any such graph G has |G| nodes of odd degree.
openaire +3 more sources
Genomics‐led approach to drug testing in models of undifferentiated pleomorphic sarcoma
Molecular Oncology, EarlyView.GA text Genomic data from undifferentiated pleomorphic sarcoma patients and preclinical models were used to inform a targeted drug screen. Selected compounds were tested in 2D and 3D cultures of UPS cell lines. A combination of trametinib and infigratinib was synergistic in the majority of UPS cell lines tested, which was further confirmed in an ex ...
Piotr J. Manasterski +19 more
wiley +1 more source
On the distance spectrum of certain distance biregular graphs
The American Journal of Combinatorics, 2023 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
Journal of Combinatorial Theory, Series B, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
The Art of Discrete and Applied Mathematics, 2020 Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os, R nyi and Rado. Automorphism groups and connections with model theory are considered.
openaire +5 more sources
Exploring the role of cyclin D1 in the pathogenesis of multiple myeloma beyond cell cycle regulation
Molecular Oncology, EarlyView.Cyclin D1 overexpression altered the cell adhesion pathway, while cyclin D2 upregulation had less impact on pathway enrichment analysis. Multiple myeloma (MM) patients with cyclin D1 overexpression showed reduced CD56 expression and increased circulating tumor cells (CTC) levels, suggesting that cyclin D1 may contribute to MM cell dissemination ...
Ignacio J. Cardona‐Benavides +13 more
wiley +1 more source
Unordered Love in infinite directed graphs
International Journal of Mathematics and Mathematical Sciences, 1992 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
On Laplacian Equienergetic Signed Graphs
Journal of Mathematics, 2021 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
On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs
Mathematics, 2022 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