Results 11 to 20 of about 2,858,268 (305)
Adjacency spectrum and Wiener index of essential ideal graph of a finite commutative ring
Journal of Algebra Combinatorics Discrete Structures and Applications, 2023 Let R be a commutative ring with unity. The essential ideal graph ER of R, is a graph with a vertex set consisting of all nonzero proper ideals of R and two vertices I and K are adjacent if and only if I + K is an essential ideal. In this paper, we study the adjacency spectrum of the essential ideal graph of the finite commutative ring Zn, for n = {pm,
Jamsheena, Panikkara +2 more
openaire +2 more sources
Determining Graphs by the Complementary Spectrum
Discussiones Mathematicae Graph Theory, 2020 The complementary spectrum of a connected graph G is the set of the complementary eigenvalues of the adjacency matrix of G. In this note, we discuss the possibility of representing G using this spectrum.
Pinheiro Lucélia K. +2 more
doaj +2 more sources
Universal adjacency spectrum of zero divisor graph on the ring and its complement [PDF]
AKCE International Journal of Graphs and Combinatorics, 2021 For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A and
Saraswati Bajaj, Pratima Panigrahi
doaj +2 more sources
Clustering Based on Eigenvectors of the Adjacency Matrix
International Journal of Applied Mathematics and Computer Science, 2018 The paper presents a novel spectral algorithm EVSA (eigenvector structure analysis), which uses eigenvalues and eigenvectors of the adjacency matrix in order to discover clusters.
Lucińska Małgorzata +1 more
doaj +2 more sources
$Kite_{p+2,p}$ is determined by its Laplacian spectrum [PDF]
Transactions on Combinatorics, 2021 $Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $p\geq4$ to an endpoint of path graph with order $n-p$. It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H.
Hatice Topcu
doaj +1 more source
On adjacency and Laplacian cospectral non-isomorphic signed graphs [PDF]
Ars Math. Contemp., 2022 Let $\Gamma=(G,\sigma)$ be a signed graph, where $\sigma$ is the sign function on the edges of $G$. In this paper, we use the operation of partial transpose to obtain non-isomorphic Laplacian cospectral signed graphs. We will introduce two new operations
Tahir Shamsher, S. Pirzada, M. Bhat
semanticscholar +1 more source
Hermitian adjacency matrix of the second kind for mixed graphs [PDF]
Discrete Mathematics, 2021 This contribution gives an extensive study on spectra of mixed graphs via its Hermitian adjacency matrix of the second kind introduced by Mohar [21]. This matrix is indexed by the vertices of the mixed graph, and the entry corresponding to an arc from u ...
Shuchao Li, Yuantian Yu
semanticscholar +1 more source
Geometry-Aware Cell Detection with Deep Learning
mSystems, 2020 Analyzing cells and tissues under a microscope is a cornerstone of biological research and clinical practice. However, the challenge faced by conventional microscopy image analysis is the fact that cell recognition through a microscope is still time ...
Hao Jiang +5 more
doaj +3 more sources
Contribution of directedness in graph spectra
Physical Review Research, 2022 In graph analyses, directed edges are often approximated to undirected ones so that the adjacency matrices may be symmetric. However, such a simplification has not been thoroughly verified. In this study, we investigate how directedness affects the graph
Masaki Ochi, Tatsuro Kawamoto
doaj +1 more source
The distance spectrum of two new operations of graphs [PDF]
Transactions on Combinatorics, 2020 Let $G$ be a connected graph with vertex set $V(G)=\{v_1, v_2,\ldots,v_n\}$. The distance matrix $D=D(G)$ of $G$ is defined so that its $(i,j)$-entry is equal to the distance $d_G(v_i,v_j)$ between the vertices $v_i$ and $v_j$ of $G$. The eigenvalues
Zikai Tang +3 more
doaj +1 more source