Results 51 to 60 of about 590,064 (163)
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
ENUMERATING TYPICAL ABELIAN PRIME-FOLD COVERINGS OF A CIRCULANT GRAPH
, 2019 Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J.
Kwon, YS, Kwak, JH, Feng, RQ
core +1 more source
Journal of Combinatorial Theory, Series B, 1980 AbstractAn algebraic characterization is given for those Cayley graphs for cyclic groups in which the neighborhood of any vertex is a cycle. A triangular imbedding is obtained for each such graph, either in the sphere, the torus, or the Klein bottle.
openaire +2 more sources
β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
Enumerating typical circulant covering projections onto a circulant graph
, 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
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
The metric dimension of circulant graphs and their Cartesian products [PDF]
Opuscula Mathematica, 2017 Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct vertices \(x,y\in V(G)\), there ...
Kevin Chau, Shonda Gosselin
doaj +1 more source
Definition and Computation of Tensor‐Based Generalized Function Composition
Numerical 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
Maximum induced subgraph of a recursive circulant
, 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)
Yang, X. +5 more
core +1 more source
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source