Results 91 to 100 of about 8,142 (196)
Moving average network examples for asymptotically stable periodic orbits of monotone maps
Electronic Journal of Qualitative Theory of Differential Equations, 2018 For a certain type of discrete-time nonlinear consensus dynamics, asymptotically stable periodic orbits are constructed. Based on a simple ordinal pattern assumption, the Frucht graph, two Petersen septets, hypercubes, a technical class of circulant ...
Barna Garay, Judit Várdai
doaj +1 more source
Methods of Sparse Measurement Matrix Optimization for Compressed Sensing
IET Signal Processing, Volume 2025, Issue 1, 2025.In compressed sensing (CS), a sparse measurement matrix with few nonzero entries is more competitive than a dense matrix in reducing the number of multiplication units. Recent studies indicate that an optimized measurement matrix having low coherence with a specified dictionary can significantly improve the reconstruction performance.
Renjie Yi +5 more
wiley +1 more source
Computational and Mathematical Methods, Volume 2025, Issue 1, 2025.This paper introduces the C-Product Toolbox, a new computational package available for MATLAB and Python, designed to perform operations on third‐order tensors using a tensor product known as the reduced c‐product. The reduced c‐product is a variant of the known c‐product, a tensor product based on the discrete cosine transform and belonging to a ...
Pablo Soto-Quiros +3 more
wiley +1 more source
Longest Induced Cycles in Circulant Graphs [PDF]
The Electronic Journal of Combinatorics, 2005 In this paper we study the length of the longest induced cycle in the unit circulant graph $X_n = Cay({\Bbb Z}_n; {\Bbb Z}_n^*)$, where ${\Bbb Z}_n^*$ is the group of units in ${\Bbb Z}_n$. Using residues modulo the primes dividing $n$, we introduce a representation of the vertices that reduces the problem to a purely combinatorial question of ...
openaire +2 more sources
Edge metric dimension of some classes of circulant graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 Let G = (V (G), E(G)) be a connected graph and x, y ∈ V (G), d(x, y) = min{ length of x − y path } and for e ∈ E(G), d(x, e) = min{d(x, a), d(x, b)}, where e = ab. A vertex x distinguishes two edges e1 and e2, if d(e1, x) ≠ d(e2, x). Let WE = {w1, w2, . .
Ahsan Muhammad +2 more
doaj +1 more source
Restricted triangulation on circulant graphs
Open Mathematics, 2018 The restricted triangulation existence problem on a given graph decides whether there exists a triangulation on the graph’s vertex set that is restricted with respect to its edge set. Let G = C(n, S) be a circulant graph on n vertices with jump value set
Ali Niran Abbas +2 more
doaj +1 more source
On metric dimension of edge comb product of vertex-transitive graphs [PDF]
Transactions on CombinatoricsSuppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $
Tita Maryati +3 more
doaj +1 more source
Invariance of KMS states on graph C*-algebras under classical and quantum symmetry
, 2018 We study invariance of KMS states on graph C*-algebras coming from strongly connected and circulant graphs under the classical and quantum symmetry of the graphs.
Joardar, Soumalya, Mandal, Arnab
core
Colouring Clique-Hypergraphs of Circulant Graphs
Graphs and Combinatorics, 2008 A clique coloring of a graph \(G\) is a coloring of the vertices of \(G\) so that no maximal clique of size at least two is monochromatic. The clique hypergraph, \(\mathcal{H}(G)\), of a graph \(G\) has \(V(G)\) as its set of vertices and the maximal cliques of \(G\) as its hyperedges. A vertex coloring of \(\mathcal{H}(G)\) is a clique coloring of \(G\
Campos, C. N. +2 more
openaire +1 more source