Results 91 to 100 of about 1,046 (212)
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
Tensor Truncated Schatten‐p Norm Approximation Tensor Completion Algorithm
IET Image Processing, Volume 19, Issue 1, January/December 2025.We propose a non‐convex surrogate for rank function, tensor truncated Schatten‐p$p$ norm. For two typical tensor recovery problems, we construct two minimization models based on tensor truncated Schatten‐p$p$ norm, namely tensor completion model based on tensor truncated Schatten‐p$p$ norm (TTSP‐TC) and tensor robust principal component analysis model ...
Jianwei Liu +5 more
wiley +1 more source
Total and fractional total colourings of circulant graphs
, 2008 International audienceIn this paper, the total chromatic number and the fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional total chromatic number and for 4-regular ...
Khennoufa, Riadh, Togni, Olivier
core +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
Unique Metro Domination Number of Circulant Graphs [PDF]
, 2019 In this paper, we determine unique metro domination number of circulant ...
John Sherra, B. Sooryanarayana
core +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
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
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
Irregular labelings of circulant graphs
Discrete Mathematics, 2012 Let \(G=(V,E)\) be an edge-labeled graph with \(w(e)>0\) being an integer for each edge \(e\in E\). Then the weighted degree \(wd(v)\) of a vertex \(v\in V\) is given by \(wd(v)=\sum_{e\backepsilon v}w(e)\). The edge labeling is called irregular if all vertices in \(V\) have distinct weighted degrees; and the smallest \(s\) so that there exists an ...
Marcin Anholcer, Cory Palmer
openaire +2 more sources
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