Results 91 to 100 of about 590,064 (163)
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Svatopluk Poljak, Daniel Turzík
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
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
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Characteristic parameter sets and limits of circulant Hermitian polygon transformations [PDF]
, 2010 Polygon transformations based on taking the apices of similar triangles constructed on the sides of an initial polygon are analyzed as well as the limit polygons obtained by iteratively applying such transformations. In contrast to other approaches, this
Vartziotis, Dimitris +3 more
core +1 more source
Edge metric dimension of some classes of circulant graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 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
Open Mathematics, 2018 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
On Ádám's conjecture for circulant graphs
Discrete Mathematics, 1997 The content of this article is analogous to the one of the author's former paper [J. Comb. Theory, Ser. A 72, No. 1, 118-134 (1995; Zbl 0833.05063)]. Now the author proves the reviewer's conjecture in case of an \(n\) (number of vertices) such that \(n/4\) is a square-free odd integer.
openaire +3 more sources
Minimum chromaticity of circulant graphs [PDF]
, 2005 We determine families of circulant graphs for which each graph G=Gc(n;S) has chromatic number χ(G)⩽3. In particular, we show that there exists an n0 such that χ(G)⩽3 for all n⩾n0 whenever S={s1,s2,…,sk} and sk>sk-1>⋯>s1 and 2s1>sk or S={s1,s2} and s2>s1 ...
Peters, Joseph +2 more
core +1 more source