Results 1 to 10 of about 116,552 (326)
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
SSRN Electronic Journal, 2006 AMS classifications: 05C50; 05E99;cospectral graphs;generalized spectrum;generalized adjacency ...
Dam, E.R. van +2 more
core +14 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
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
On the Displacement of Eigenvalues When Removing a Twin Vertex [PDF]
Discussiones Mathematicae Graph Theory, 2020 Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix.
Briffa Johann A., Sciriha Irene
doaj +3 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
General Zagreb adjacency matrix [PDF]
Contributions to Mathematics, 2022 Zhen Lin
doaj +2 more sources
Unified Spectral Bounds on the Chromatic Number
Discussiones Mathematicae Graph Theory, 2015 One of the best known results in spectral graph theory is the following lower bound on the chromatic number due to Alan Hoffman, where μ1 and μn are respectively the maximum and minimum eigenvalues of the adjacency matrix: χ ≥ 1+μ1/−μn.
Elphick Clive, Wocjan Pawel
doaj +3 more sources
Rank-GCN for Robust Action Recognition
IEEE Access, 2022 We present a robust skeleton-based action recognition method with graph convolutional network (GCN) that uses the new adjacency matrix, called Rank-GCN. In Rank-GCN, the biggest change from previous approaches is how the adjacency matrix is generated to ...
Haetsal Lee +3 more
doaj +1 more source
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
Theory and Applications of Graphs, 2023 The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +1 more source
Anti-Adjacency Matrices of Certain Graphs Derived from Some Graph Operations
Ratio Mathematica, 2023 If we go through the literature, one can find many matrices that are derived for a given simple graph. The one among them is the anti-adjacency matrix which is given as follows; The anti-adjacency matrix of a simple undirected graph $G$ with vertex set
Manju V N, Athul T B, Suresh Singh G
doaj +1 more source