Results 11 to 20 of about 113,956 (308)
General Zagreb adjacency matrix [PDF]
Contributions to Mathematics, 2022 Zhen Lin
doaj +2 more sources
Clustering Based on Eigenvectors of the Adjacency Matrix [PDF]
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
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
SSRN Electronic Journal, 2006 AbstractLet J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old result of Johnson and Newman states that if two graphs are cospectral with respect to yJ−A for two distinct values of y, then they are cospectral for all y. Here we will focus on graphs cospectral with respect to yJ−A for exactly one value yˆ of y.
Edwin van Dam +2 more
openalex +12 more sources
The adjacency matrix and the discrete Laplacian acting on forms [PDF]
Mathematical Physics, Analysis and Geometry, 2015 We study the relationship between the adjacency matrix and the discrete Laplacian acting on 1-forms. We also prove that if the adjacency matrix is bounded from below it is not necessarily essentially self-adjoint.
Baloudi, Hatem +2 more
core +3 more sources
On the Adjacency Matrix of RyR2 Cluster Structures. [PDF]
PLoS Comput Biol, 2015 In the heart, electrical stimulation of cardiac myocytes increases the open probability of sarcolemmal voltage-sensitive Ca2+ channels and flux of Ca2+ into the cells. This increases Ca2+ binding to ligand-gated channels known as ryanodine receptors (RyR2).
Walker MA +5 more
europepmc +7 more sources
On the adjacency matrix of a block graph [PDF]
Linear and Multilinear Algebra, 2013 A block graph is a graph in which every block is a complete graph. Let be a block graph and let be the adjacency matrix of . We first obtain a formula for the determinant of over reals. It is shown that is nonsingular over if and only if the removal of any vertex from produces a graph with exactly one odd component. A formula for the inverse of over is
R.B. Bapat, Souvik Roy
openalex +3 more sources
The Kernel of the Adjacency Matrix of a Rectangular Mesh [PDF]
, 2002 Given an m x n rectangular mesh, its adjacency matrix A, having only integer entries, may be interpreted as a map between vector spaces over an arbitrary field K. We describe the kernel of A: it is a direct sum of two natural subspaces whose dimensions are equal to $\lceil c/2 \rceil$ and $\lfloor c/2 \rfloor$, where c = gcd (m+1,n+1) - 1. We show that
C. Tomei, Vieira
openalex +3 more sources
Generating Adjacency Matrix for Video Relocalization
, 2020 In this paper, we continue our work on video relocalization task. Based on using graph convolution to extract intra-video and inter-video frame features, we improve the method by using similarity-metric based graph convolution, whose weighted adjacency matrix is achieved by calculating similarity metric between features of any two different time steps ...
Yuan Zhou +3 more
openalex +4 more sources
A Note on the Estrada Index of the Aα-Matrix
Mathematics, 2021 Let G be a graph on n vertices. The Estrada index of G is an invariant that is calculated from the eigenvalues of the adjacency matrix of a graph. V. Nikiforov studied hybrids of A(G) and D(G) and defined the Aα-matrix for every real α∈[0,1] as: Aα(G)=αD(
Jonnathan Rodríguez, Hans Nina
doaj +1 more source
Universal adjacency spectrum of zero divisor graph on the ring and its complement
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 +1 more source