Results 91 to 100 of about 8,162 (190)
Large circulant graphs of fixed diameter and arbitrary degree [PDF]
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
Enumerating Typical Circulant Covering Projections Onto a Circulant Graph
Summary: Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory [see \textit{S. F. Du, D. Marušič}, and \textit{A. O. Waller}, J. Comb. Theory, Ser. B 74, 276--290 (1998; Zbl 1026.05057), \textit{S. F. Du, J. H. Kwak}, and \textit{M. Y.
Feng, RQ, Kwak, JH, Kwon, YS
openaire +2 more sources
Tensor Truncated Schatten‐p Norm Approximation Tensor Completion Algorithm
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
Moving average network examples for asymptotically stable periodic orbits of monotone maps
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
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
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]
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
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
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

