Results 111 to 120 of about 975,970 (227)
A New Algorithm for Computing the Distance and the Diameter in Circulant Graphs
AlgorithmsIn the present study, we focus on circulant graphs, Cn(S), with set of vertices {0,1,…,n−1} and in which two distinct vertices i and j are adjacent if and only if |i−j|n∈S, where S is a generating set.
Laila Loudiki, Mustapha Kchikech
doaj +1 more source
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
A Formula for the Energy of Circulant Graphs with Two Generators
Journal of Applied Mathematics, 2016 We derive closed formulas for the energy of circulant graphs generated by 1 and γ, where γ⩾2 is an integer. We also find a formula for the energy of the complete graph without a Hamilton cycle.
Justine Louis
doaj +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
Mathematical Properties of the Hyperbolicity of Circulant Networks
Advances in Mathematical Physics, 2015 If X is a geodesic metric space and x1,x2,x3∈X, a geodesic triangle T={x1,x2,x3} is the union of the three geodesics [x1x2], [x2x3], and [x3x1] in X.
Juan C. Hernández +2 more
doaj +1 more source
Computational and Mathematical Methods, Volume 2025, Issue 1, 2025.The generalized Mycielskian graphs are known for their advantageous properties employed in interconnection networks in parallel computing to provide efficient and optimized network solutions. This paper focuses on investigating the bounds and computation of the harmonic–arithmetic index of the generalized Mycielskian graph of path graph, cycle graph ...
Pooja Danushri Namidass +2 more
wiley +1 more source
Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs
Discrete Mathematics & Theoretical Computer Science, 2008 For a set D⊂ Z n, the distance graph P n (D) has Z n as its vertex set and the edges are between vertices i and j with |i-j|∈D. The circulant graph C n (D) is defined analogously by considering operations modulo n.
Hamamache Kheddouci, Olivier Togni
doaj
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