Results 21 to 30 of about 2,949,927 (358)
The adjacency matrix and the discrete Laplacian acting on forms
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 +2 more sources
Hermitian Adjacency Matrix of Digraphs and Mixed Graphs [PDF]
AbstractThe article gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from x to y is equal to the complex unity i (and its symmetric entry is ) if the reverse arc is not present.
Guo, Krystal, Mohar, Bojan
openaire +4 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
Centerless Multi-View K-means Based on the Adjacency Matrix
Although K-Means clustering has been widely studied due to its simplicity, these methods still have the following fatal drawbacks. Firstly, they need to initialize the cluster centers, which causes unstable clustering performance.
Han Lu +4 more
semanticscholar +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
Extremal Problems for Graphical Function-Indices and f-Weighted Adjacency Matrix
Let f(x, y) (f(x)) be a symmetric real function (real function) and G = (V,E) be a graph. Denote by di the degree of a vertex i in G. The graphical function-index TIf (G) (Hf (G)) of G with edge-weight (vertex-weight) function f(x, y) (f(x)) is defined ...
Xueliang Li, Danni Peng
semanticscholar +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

