Results 81 to 90 of about 8,142 (196)

A Formula for the Energy of Circulant Graphs with Two Generators

open access: yesJournal 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

The Fibonacci numbers of certain subgraphs of circulant graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2015
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo   +1 more
doaj   +1 more source

FROBENIUS CIRCULANT GRAPHS OF VALENCY FOUR [PDF]

open access: yesJournal 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

open access: yesImmunity, 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

Minimum Feedback Vertex Sets in Distance Graphs and Circulant Graphs

open access: yesDiscrete 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  

E74‐like ETS transcription factor 3 expression and regulation in human intervertebral disc

open access: yesJOR 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

On the rank of the Doob graph and its complement

open access: yesKuwait Journal of Science, 2018
We compute the rank of the circulant Doob graph defined in Doob (2002). We also compute the rank and the determinant of its complement graph.
Ilhan Hacioglu, Kerem Kaskaloglu
doaj  

Some distance magic graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
A graph G = ( V , E ) , where | V | = n and | E | = m is said to be a distance magic graph if there exists a bijection from the vertex set V to the set { 1 , 2 , … , n } such that, ∑ v ∈ N ( u ) f ( v ) = k , for all u ∈ V , which is a constant and ...
Aloysius Godinho, T. Singh
doaj   +1 more source

Enumerating Typical Circulant Covering Projections Onto a Circulant Graph

open access: yesSIAM 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

open access: yesIET 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   +5 more
wiley   +1 more source

Home - About - Disclaimer - Privacy