Results 1 to 10 of about 122,412 (281)
General Zagreb adjacency matrix [PDF]
Zhen Lin
doaj +2 more sources
Clustering Based on Eigenvectors of the Adjacency Matrix
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
Unified Spectral Bounds on the Chromatic Number
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
Cospectral Graphs and the Generalized Adjacency Matrix [PDF]
AMS classifications: 05C50; 05E99;cospectral graphs;generalized spectrum;generalized adjacency ...
Dam, E.R. van +2 more
core +13 more sources
On the Adjacency Matrix of RyR2 Cluster Structures. [PDF]
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
Rank-GCN for Robust Action Recognition
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
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
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
Relationship between adjacency and distance matrix of graph of diameter two
The relationship among every pair of vertices in a graph can be represented as a matrix, such as in adjacency matrix and distance matrix. Both adjacency and distance matrices have the same property.
Siti L. Chasanah +3 more
doaj +1 more source
Some New Bounds for α-Adjacency Energy of Graphs
Let G be a graph with the adjacency matrix A(G), and let D(G) be the diagonal matrix of the degrees of G. Nikiforov first defined the matrix Aα(G) as Aα(G)=αD(G)+(1−α)A(G), 0≤α≤1, which shed new light on A(G) and Q(G)=D(G)+A(G), and yielded some ...
Haixia Zhang, Zhuolin Zhang
doaj +1 more source

