Results 81 to 90 of about 410 (178)
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
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
Total colorings of some classes of four regular circulant graphs
AKCE International Journal of Graphs and CombinatoricsThe total chromatic number, [Formula: see text] is the minimum number of colors which need to be assigned to obtain a total coloring of the graph G. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, [Formula:
R. Navaneeth +3 more
doaj +1 more source
On metric dimension of edge comb product of vertex-transitive graphs [PDF]
Transactions on CombinatoricsSuppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $
Tita Maryati +3 more
doaj +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Svatopluk Poljak, Daniel Turzík
openaire +1 more source
Strong regularity and circulant graphs
Discrete Mathematics, 1989 Let p be a prime number. The paper characterizes a strong regular \(p^ k\)-circulant graph. Also, the paper gives a representation of Paley graphs of order \(p^ 2\). Specifically, it is shown that a \(p^ k\)- circulant graph is a nontrivial strongly regular graph if and only if \(k=1\) and it is isomorphic to the Paley graph of order p.
openaire +2 more sources
QC-LDPC Codes Construction by Concatenating of Circulant Matrices as Block-Columns
International Journal of Information and Communication Technology Research, 2016 In this paper a new low complexity method for constructing binary quasi-cyclic low-density parity-check (QC-LDPC) codes is introduced. In the proposed method, each block-column of the parity check matrix H is made by a circulant matrix in a way that the ...
Mohammad Hesam Tadayon +1 more
doaj
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 +1 more source
On the symmetries of some classes of recursive circulant graphs
Transactions on Combinatorics, 2014 A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties.
Seyed Morteza Mirafzal
doaj