Results 81 to 90 of about 6,790 (196)

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, Kunwoo Park, Hyungchul Park, Sunkyu Yu, Namkyoo Park, Xianji Piao   +5 more
wiley   +1 more source

The eigenvalues and energy of integral circulant graphs [PDF]

Transactions on Combinatorics, 2012
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency matrix is circulant. Let $D$ be aset of positive, proper divisors of the integer $n>1$.
Mohsen Mollahajiaghaei
doaj  

Bounds for minimum feedback vertex sets in distance graphs and circulant graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2008
Graphs and ...
Hamamache Kheddouci, Olivier Togni
doaj   +1 more source

FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR [PDF]

Journal of the Australian Mathematical Society, 2008
AbstractA first kind Frobenius graph is a Cayley graph Cay(K,S) on the Frobenius kernel of a Frobenius group $K \rtimes H$ such that S=aH for some a∈K with 〈aH〉=K, where H is of even order or a is an involution. It is known that such graphs admit ‘perfect’ routing and gossiping schemes.
Thomson, A, Zhou, S
openaire   +3 more sources

Serum Lactate Dehydrogenase Levels Reflect the Lung Injury Extension in COVID‐19 Patients at Hospital Admission

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, Giulia Vannucci, Rebecca Piccarducci, Lorenzo Germelli, Chiara Giacomelli, Chiara Romei, Brian Bartholmai, Greta Barbieri, Claudia Martini, Michela Baccini   +9 more
wiley   +1 more source

The metric dimension of circulant graphs [PDF]

Opuscula Mathematica
A pair of vertices \(x\) and \(y\) in a graph \(G\) are said to be resolved by a vertex \(w\) if the distance from \(x\) to \(w\) is not equal to the distance from \(y\) to \(w\).
Tapendra BC, Shonda Dueck
doaj   +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, Djedjiga Ait Eldjoudi, Alfonso Cordero‐Barreal, Mariam Farrag, María Varela‐García, Clara Ruiz‐Fernández, Carlos Torrijos‐Pulpón, Francisca Lago, Lucía García‐Caballero, Yousof Farrag, Javier Conde‐Aranda, Jesus Pino, Oreste Gualillo   +12 more
wiley   +1 more source

Enumerating Typical Circulant Covering Projections Onto a Circulant Graph

SIAM Journal on Discrete Mathematics, 2005
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

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, Liangfu Lu, Ping Wang, Haipeng Liu, Yuanchen Huang, Yunliang Zang   +5 more
wiley   +1 more source

A New Algorithm for Computing the Distance and the Diameter in Circulant Graphs

Algorithms
In 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