Results 61 to 70 of about 990 (211)

Post‐surgery level of circulating DNA in stage III colon cancer patients: Impact on the reliability of minimal residual disease detection

open access: yesInternational 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

Block circulant graphs and the graphs of critical pairs of crowns

open access: yesElectronic Journal of Graph Theory and Applications, 2019
In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia   +3 more
doaj   +1 more source

Enumerating typical circulant covering projections onto a circulant graph

open access: yes, 2018
Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory ( see [ S. F. Du, D. Marusic, and A. O. Waller, J. Combin. Theory Ser. B, 74 ( 1998), pp. 276
Kwon, YS, Kwak, JH, Feng, RQ, Feng, R
core   +1 more source

β3‐adrenoceptor agonism exerts lung protection in a rat model of bronchopulmonary dysplasia

open access: yesBritish 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

Maximum induced subgraph of a recursive circulant

open access: yes, 2005
The recursive circulant RC(2(n), 4) enjoys several attractive topological properties. Let max_epsilon(G) (m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. In this paper, we show that max_epsilon(RC(2n,4))(m) = Sigma(i)(r)
Megson, G. M.   +5 more
core   +1 more source

Accelerating Conjugate Gradient Solvers for Homogenization Problems With Unitary Neural Operators

open access: yesInternational 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 circulant chromatic number and circulant chromatic function

open access: yes, 2001
A new concept of circulant chromatic function of a graph is introduced to generalize the concept of chromatic polynomial of a graph. This is similar to the generalization from the concept of chromatic number to the concept of circulant chromatic number ...
Zhixiong Wang   +3 more
core   +1 more source

Definition and Computation of Tensor‐Based Generalized Function Composition

open access: yesNumerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.
ABSTRACT Functions are fundamental to mathematics as they offer a structured and analytical framework to express relations between variables. While scalar and matrix‐based functions are well‐established, higher‐order tensor‐based functions have not been as extensively explored.
Remy Boyer
wiley   +1 more source

Betti numbers of some circulant graphs [PDF]

open access: yes, 2019
summary:Let $o(n)$ be the greatest odd integer less than or equal to $n$. In this paper we provide explicit formulae to compute $\mathbb {N}$-graded Betti numbers of the circulant graphs $C_{2n}(1,2,3,5,\ldots ,o(n))$.
Mousivand, Amir, Abdi Makvand, Mohsen
core   +1 more source

Algebraic Connectivity Maximizing Regular Graphs: Special Case Analysis and Depth‐First Search

open access: yesConcurrency and Computation: Practice and Experience, Volume 37, Issue 27-28, 25 December 2025.
ABSTRACT The algebraic connectivity is an indicator of how well connected a graph is. It also characterizes the convergence speed of some dynamic processes over networks. In this paper, taking into account that homogeneous networks are modeled as regular graphs, we tackle the following problem: given a pair (n,k)$$ \left(n,k\right) $$ of positive ...
Masashi Kurahashi   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy