Results 91 to 100 of about 990 (211)
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
Programmable photonic unitary circuits for light computing
Nanophotonics, Volume 14, Issue 10, Page 1429-1449, May 2025.Abstract Unitarity serves as a fundamental concept for characterizing linear and conservative wave phenomena in both classical and quantum systems. Developing platforms that perform unitary operations on light waves in a universal and programmable manner enables the emulation of complex light–matter interactions and the execution of general‐purpose ...
Kyuho Kim +5 more
wiley +1 more source
Immunity, Inflammation and Disease, Volume 13, Issue 3, March 2025.The relationship between the lung involvement expressed by quantitative computed tomography (CALIPER) and a set of blood parameters related to tissue oxygenation and damage in COVID‐19 patients at hospital admission was evaluated in a retrospective and a prospective study involving 321 and 75, respectively, COVID‐19‐positive patients.
Maria Sofia Bertilacchi +9 more
wiley +1 more source
E74‐like ETS transcription factor 3 expression and regulation in human intervertebral disc
JOR SPINE, Volume 8, Issue 1, March 2025.This research unveils, for the first time, the role of ELF3 in intervertebral disc degeneration (IVDD). It sheds light on the intricate interplay between ELF3 expression and the inflammatory as well as degenerative processes inherent to IVDD. Understanding the role of ELF3 in disc pathophysiology may hold potentials in developing therapies aimed at ...
María González‐Rodríguez +12 more
wiley +1 more source
Isomorphism of circulant graphs and digraphs
Discrete Mathematics, 1979 AbstractLet S⊆ {1, …, n−1} satisfy −S = S mod n. The circulant graph G(n, S) with vertex set {v0, v1,…, vn−1} and edge set E satisfies vivj ϵ E if and only if j − i ∈ S, where all arithmetic is done mod n. The circulant digraph G(n, S) is defined similarly without the restriction S = − S.
Brian Alspach, Torrence D. Parsons
openaire +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
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
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