Results 81 to 90 of about 1,046 (212)
The metric dimension of circulant graphs and their Cartesian products [PDF]
Opuscula Mathematica, 2017 Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct vertices \(x,y\in V(G)\), there ...
Kevin Chau, Shonda Gosselin
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
On the metric dimension of circulant graphs with $4$ generators
, 2017 Circulant graphs are Cayley graphs of cyclic groups and the metric dimension of circulant graphs with at most $3$ generators has been extensively studied especially in the last decade.
Vetrik, Tomas
core +1 more source
The metric dimension of circulant graphs [PDF]
Opuscula MathematicaA 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 +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
On the spectral Ádám property for circulant graphs
, 2002 We investigate a certain condition for isomorphism between circulant graphs (known as the Ádám property) in a stronger form by referring to isospectrality rather than to isomorphism of graphs.
Pappalardi, F +7 more
core +1 more source
Sum coloring of distance and circulant graphs
, 2005 International audienceA distance graph (resp. circulant graph) is a graph obtained from the path (resp. the cycle) of order n by adding chordal edges between any pair of vertices at distance d\in D, D\subseteq Zn.
Kheddouci, Hamamache, Effantin, Brice
core +4 more sources