Results 51 to 60 of about 287 (207)

Adjacency spectra and Laplacian integrality of zero divisor graphs over some rings

Kuwait Journal of Science
Let 𝑅 be a commutative ring and let 𝑍∗ (𝑅) denote the set of non-zero zero divisors of 𝑅. The zero divisor graph 𝛤(𝑅) is defined as the simple graph with vertex set 𝑍∗ (𝑅), where two distinct vertices 𝑥, 𝑦 ∈ 𝑍∗ (𝑅) are adjacent if and only if 𝑥𝑦 = 0.
Bilal Ahmad Rather, Parvez Ali, M. Imran, A. Kothepeda   +3 more
doaj   +1 more source

Aα-Spectral Characterizations of Some Joins

Journal of Mathematics, 2020
Let G be a graph with n vertices. For every real α∈0,1, write AαG for the matrix AαG=αDG+1−αAG, where AG and DG denote the adjacency matrix and the degree matrix of G, respectively.
Tingzeng Wu, Tian Zhou
doaj   +1 more source

Normal‐Appearing White Matter Injury Mediates Chronic Deep Venous Hypoxia and Disease Progression in Multiple Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore how cerebral hypoxia and Normal‐Appearing White Matter (NAWM) integrity affect MS lesion burden and clinical course. Methods Seventy‐nine MS patients, including 13 clinically isolated syndrome (CIS) patients and 66 relapsing–remitting multiple sclerosis (RRMS) patients, and 44 healthy controls (HCs) were recruited from ...
Xinli Wang, Huiying Wang, Zhizheng Zhuo, Ai Guo, Ke Lv, Decai Tian, Chao Chai, Yunyun Duan, Shuang Xia   +8 more
wiley   +1 more source

Universal adjacency spectrum of (proper) power graphs and their complements on some groups

, 2023
The power graph $\mathscr{P}(G)$ of a group $G$ is an undirected graph with all the elements of $G$ as vertices and where any two vertices $u$ and $v$ are adjacent if and only if $u=v^m $ or $v=u^m$, $ m \in$ $\mathbb{Z}$. For a simple graph $H$ with adjacency matrix $A(H)$ and degree diagonal matrix $D(H)$, the universal adjacency matrix is $U(H)= αA ...
Kumari, Komal, Panigrahi, Pratima
openaire   +2 more sources

SPG4 and Dementia: Expanding the Clinical Spectrum

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Hereditary spastic paraplegia (HSP) is a group of disorders characterized by progressive spasticity and lower limb weakness, with mutations in SPG4/SPAST being the most common cause. Detailed studies and clinical and molecular comparisons across different populations are missing.
Emanuele Panza, Arun Meyyazhagan, Eliseo Picchi, Gustavo Ribas, Ingrid Faber, Ryosuke Miyamoto, Preethi Basavaraju, Paolo Eusebi, Haripriya Kuchi Bhotla, Mario Stasi, Fabrizio Gaudiello, Francesco Patti, Filippo Maria Santorelli, Marcondes Cavalcante França Jr, José Luiz Pedroso, Orlando Graziani Povoas Barsottini, Hélio Afonso Ghizoni Teive, Peter Henry St George‐Hyslop, Toshitaka Kawarai, Antonio Orlacchio   +19 more
wiley   +1 more source

Graphs cospectral with a friendship graph or its complement [PDF]

Transactions on Combinatorics, 2013
Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill) graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$.
Alireza Abdollahi, Shahrooz Janbaz, Mohammad Reza Oboudi   +2 more
doaj  

Clinical Outcomes of SEEG‐Guided Radiofrequency Thermocoagulation in Children With Focal Drug‐Resistant Epilepsy: A Multicenter Real‐World Study

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Stereoelectroencephalography‐guided radiofrequency thermocoagulation (SEEG‐RFTC) has emerged as a safe and effective minimally invasive treatment for children with drug‐resistant focal epilepsy. Although evidence from real‐world studies remains limited, numerous pediatric cases have demonstrated promising outcomes. This retrospective
Weitao Chen, Stéphane Jean, Weihong Liu, Yihai Dai, Xinrong Fang, Xiaoqiang Wei, Shan Chen, Shiwei Song   +7 more
wiley   +1 more source

Distance spectrum of Indu–Bala product of graphs

AKCE International Journal of Graphs and Combinatorics, 2016
The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is denoted by
G. Indulal, R. Balakrishnan
doaj   +1 more source

Entropy of the Adjacency Spectrum: A New Graph Invariant

Journal of Advances in Mathematics and Computer Science
We introduce the spectral entropy topological index S(G), defined as the Shannon entropy of the squared adjacency eigenvalues of a simple graph G. This construction converts the adjacency spectrum into a probability distribution and yields a concise measure of global structural complexity.
Santhoshkumar C G, Bindhu K Thomas
openaire   +1 more source

Understanding Further the Phenotypic Spectrum of Central Nervous System Inflammatory Demyelinating Disorders Using Unsupervised Clustering

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Central nervous system (CNS) inflammatory demyelinating syndromes, including multiple sclerosis (MS), aquaporin‐4 antibody–positive neuromyelitis optica spectrum disorder (AQP4 + NMOSD), and myelin oligodendrocyte glycoprotein (MOG) antibody–associated disease (MOGAD), occasionally overlap.
Bade Gulec, Elif Everest, Melih Tutuncu, Ugur Bilge, Sabahattin Saip, Ugur Uygunoglu, Aksel Siva   +6 more
wiley   +1 more source