Results 51 to 60 of about 1,046 (212)
International Journal of Cancer, Volume 158, Issue 10, Page 2771-2783, 15 May 2026.What's New? Circulating nuclear DNA (cir‐nDNA)‐based assessment of minimal residual disease (MRD) offers powerful post‐surgery prognostic insight for stage III colon cancer (CC). Sparse knowledge of post‐surgical variations and origins in cir‐nDNA, however, has limited its clinical application.
Andrei Kudriavtsev +17 more
wiley +1 more source
Typical circulant double coverings of a circulant graph
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng, RQ, Kwak, JH
openaire +3 more sources
Two families of circulant nut graphs
, 2022 A circulant nut graph is a non-trivial simple graph whose adjacency matrix is a circulant matrix of nullity one such that its non-zero null space vectors have no zero elements.
Damnjanović, Ivan
core +1 more source
Fault-Tolerant Metric Dimension of Circulant Graphs
Mathematics, 2022 Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d ...
Laxman Saha +4 more
doaj +1 more source
β3‐adrenoceptor agonism exerts lung protection in a rat model of bronchopulmonary dysplasia
British Journal of Pharmacology, Volume 183, Issue 10, Page 2497-2517, May 2026.The β3‐adrenoceptors agonist BRL37344 promotes lung maturation, preventing the progression of experimental bronchopulmonary dysplasia. Absract Background and Purpose Bronchopulmonary dysplasia (BPD) affects premature newborns, particularly those receiving supplemental oxygen therapy.
Alessandro Pini +14 more
wiley +1 more source
On the average energy of circulant graphs
, 2008 We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d.
Blackburn, Simon R. +1 more
core +1 more source
Defensive alliances in regular graphs and circulant graphs [PDF]
, 2008 In this paper we study defensive alliances in some regular graphs. We determine which subgraphs could a critical defensive alliance of a graph $G$ induce, if $G$ is $6$-regular and the cardinality of the alliance is at most $8$.
Barrière Figueroa, Eulalia +1 more
core +1 more source
Accelerating Conjugate Gradient Solvers for Homogenization Problems With Unitary Neural Operators
International Journal for Numerical Methods in Engineering, Volume 127, Issue 5, 15 March 2026.ABSTRACT Rapid and reliable solvers for parametric partial differential equations (PDEs) are needed in many scientific and engineering disciplines. For example, there is a growing demand for composites and architected materials with heterogeneous microstructures.
Julius Herb, Felix Fritzen
wiley +1 more source
On the energy of some circulant graphs
, 2005 We give an explicit construction of circulant graphs of very high energy. This construction is based on Gauss sums. We also show the Littlewood conjecture can be used to establish new result for a certain class of circulant ...
Shparlinski, Igor, Igor Shparlinski
core +1 more source
Solving Two Conjectures regarding Codes for Location in Circulant Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Identifying and locating-dominating codes have been widely studied in circulant graphs of type $C_n(1,2, \ldots, r)$, which can also be viewed as power graphs of cycles.
Ville Junnila +2 more
doaj +1 more source