Results 51 to 60 of about 6,790 (196)
Large circulant graphs of fixed diameter and arbitrary degree [PDF]
, 2017 We consider the degree-diameter problem for undirected and directed circulant graphs. To date, attempts to generate families of large circulant graphs of arbitrary degree for a given diameter have concentrated mainly on the diameter 2 case.
Bevan, David +2 more
core +1 more source
Sampling and Reconstruction of Sparse Signals on Circulant Graphs - An Introduction to Graph-FRI
, 2017 With the objective of employing graphs toward a more generalized theory of signal processing, we present a novel sampling framework for (wavelet-)sparse signals defined on circulant graphs which extends basic properties of Finite Rate of Innovation (FRI)
Dragotti, Pier Luigi +1 more
core +1 more source
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
Distinguishing Number for some Circulant Graphs [PDF]
, 2014 Introduced by Albertson et al. \cite{albertson}, the distinguishing number $D(G)$ of a graph $G$ is the least integer $r$ such that there is a $r$-labeling of the vertices of $G$ that is not preserved by any nontrivial automorphism of $G$. Most of graphs
Gravier, Sylvain +2 more
core
, 2015 We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$ factors.
Louis, Justine
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
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
Zero Forcing Sets and Bipartite Circulants [PDF]
, 2010 In this paper we introduce a class of regular bipartite graphs whose biadjacency matrices are circulant matrices and we describe some of their properties.
Meyer, Seth A.
core
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
Open Locating-Dominating Sets in Circulant Graphs
Discussiones Mathematicae Graph Theory, 2022 Location detection problems have been studied for a variety of applications including finding faults in multiprocessors, contaminants in public utilities, intruders in buildings and facilities, and for environmental monitoring using wireless sensor ...
Givens Robin M. +2 more
doaj +1 more source