Results 81 to 90 of about 332 (178)
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
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
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
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
Mathematical Properties of the Hyperbolicity of Circulant Networks
Advances in Mathematical Physics, 2015 If X is a geodesic metric space and x1,x2,x3∈X, a geodesic triangle T={x1,x2,x3} is the union of the three geodesics [x1x2], [x2x3], and [x3x1] in X.
Juan C. Hernández +2 more
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
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
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
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
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Svatopluk Poljak, Daniel Turzík
openaire +1 more source