Results 71 to 80 of about 587,527 (280)
On Locating-Dominating Set of Regular Graphs
Journal of Mathematics, 2021 Let G be a simple, connected, and finite graph. For every vertex v∈VG, we denote by NGv the set of neighbours of v in G. The locating-dominating number of a graph G is defined as the minimum cardinality of W ⊆ VG such that every two distinct vertices u,v∈
Anuwar Kadir Abdul Gafur +1 more
doaj +1 more source
The PI3Kδ inhibitor roginolisib (IOA‐244) preserves T‐cell function and activity
Molecular Oncology, EarlyView.Identification of novel PI3K inhibitors with limited immune‐related adverse effects is highly sought after. We found that roginolisib and idelalisib inhibit chronic lymphocytic leukemia (CLL) cells and Treg suppressive functions to similar extents, but roginolisib affects cytotoxic T‐cell function and promotion of pro‐inflammatory T helper subsets to a
Elise Solli +7 more
wiley +1 more source
Strongly regular graphs from weakly regular plateaued functions
, 2018 The paper provides the first constructions of strongly regular graphs and association schemes from weakly regular plateaued functions over finite fields of odd characteristic.
Mesnager, Sihem, Sınak, Ahmet
core +1 more source
Cogrowth of regular graphs [PDF]
Proceedings of the American Mathematical Society, 1992 Let G \mathcal {G} be a d d -regular graph and T T the covering tree of G \mathcal {G} . We define a cogrowth constant of G \mathcal {G} in T T and express it in terms of the first eigenvalue of the Laplacian on
openaire +2 more sources
Molecular Oncology, EarlyView.This work identified serum proteins associated with pancreatic epithelial neoplasms (PanINs) and early‐stage PDAC. Proteomics screens assessed genetically engineered mice with abundant PanINs, KPC mice (Lox‐STOP‐Lox‐KrasG12D/+ Lox‐STOP‐Lox‐Trp53R172H/+ Pdx1‐Cre) before PDAC development and also early‐stage PDAC patients (n = 31), compared to benign ...
Hannah Mearns +10 more
wiley +1 more source
The strongly regular (45,12,3,3) graphs [PDF]
, 2006 Using two backtrack algorithms based on dierent techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters v = 45, k = 12, λ = μ = 3.
Coolsaet, K., Degraer, J., Spence, E.
core
Discrete Applied Mathematics, 2003 The authors study the problem of \(r\)-regular graph generation. The considered graphs can posses multiple edges between each pair \((x,y)\) of vertices, so they can be seen as labeled graphs with an integer accompanying each edge. Therefore, the subjective loopless graphs can be seen as flow networks. Two general approaches to generation are discussed.
Ding, Guoli, Chen, Peter
openaire +2 more sources
Molecular Oncology, EarlyView.Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova +25 more
wiley +1 more source
One note on the number of pairwise non-isomorphic connected regular graphs
Mathematics OpenIn this paper, we give an explicit expression for the number of pairwise non-isomorphic connected regular graphs as well as odd graphs on n vertices, where [Formula: see text] is a positive integer.
Hailin Liu, Liping Zhong, Huixian Xu
doaj +1 more source
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
Discussiones Mathematicae Graph Theory, 2019 For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj +1 more source