A binary biclustering algorithm based on the adjacency difference matrix for gene expression data analysis [PDF]
BMC Bioinformatics, 2022 Biclustering algorithm is an effective tool for processing gene expression datasets. There are two kinds of data matrices, binary data and non-binary data, which are processed by biclustering method.
He-Ming Chu +5 more
doaj +2 more sources
Relationship between adjacency and distance matrix of graph of diameter two
Indonesian Journal of Combinatorics, 2021 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 +3 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
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
A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree. [PDF]
Springerplus, 2016 Nagoor Gani A, Latha SR.
europepmc +3 more sources
An adaptive adjacency matrix-based graph convolutional recurrent network for air quality prediction. [PDF]
Sci RepChen Q +5 more
europepmc +2 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
Some New Bounds for α-Adjacency Energy of Graphs
Mathematics, 2023 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