Results 51 to 60 of about 28,893 (164)
Adjacency Matrix of Product of Graphs
Kalpa Publications in Computing, 2018 In graph theory, different types of matrices associated with graph, e.g. Adjacency matrix, Incidence matrix, Laplacian matrix etc. Among all adjacency matrix play an important role in graph theory. Many products of two graphs as well as its generalized form had been studied, e.g., cartesian product, 2−cartesian product, tensor product, 2−tensor product
Urvashi Acharya, Himali Mehta
openaire +2 more sources
Vertex colouring using the adjacency matrix
Journal of Physics: Conference Series, 2019 Recently, graph theory is one of the most rapidly developing sciences. Graphs in its applications are generally used to represent discrete objects and relationships between these objects. The visual representation of a graph is to declare an object as a vertex, while the relationship between objects is expressed as an edge. One topic in graph theory is
K A Santoso +4 more
openaire +1 more source
γ-Inverse graph of some mixed graphs
Special MatricesLet GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa +2 more
doaj +1 more source
On the Displacement of Eigenvalues When Removing a Twin Vertex
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 +1 more source
Enhanced Adjacency Matrix-Based Lightweight Graph Convolution Network for Action Recognition. [PDF]
Sensors (Basel), 2023 Zhang D, Deng H, Zhi Y.
europepmc +1 more source
Evaluating adjacency matrix for network visualization
, 2021 Adjacency Matrix (AM) is one of the commonly used techniques to visualize networks. While an AM provides a clean and compact representation for dense networks, several studies have shown that it is not suitable for path-related tasks. Several visualization techniques have been proposed to address this limitation.
openaire +2 more sources
The adjacency spectrum of two new operations of graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let be a graph and be its adjacency matrix. The eigenvalues of are the eigenvalues of and form the adjacency spectrum, denoted by . In this paper, we introduce two new operations and , and describe the adjacency spectra of and of regular graphs , and ...
Dijian Wang, Yaoping Hou, Zikai Tang
doaj +1 more source
Dynamic Correlation Adjacency-Matrix-Based Graph Neural Networks for Traffic Flow Prediction. [PDF]
Sensors (Basel), 2023 Gu J, Jia Z, Cai T, Song X, Mahmood A.
europepmc +1 more source
Node Importance Identification for Temporal Networks Based on Optimized Supra-Adjacency Matrix. [PDF]
Entropy (Basel), 2022 Liu R, Zhang S, Zhang D, Zhang X, Bao X.
europepmc +1 more source
A formula for all minors of the adjacency matrix and an application
Special Matrices, 2014 We supply a combinatorial description of any minor of the adjacency matrix of a graph. This descriptionis then used to give a formula for the determinant and inverse of the adjacency matrix, A(G), of agraph G, whenever A(G) is invertible, where G is ...
Bapat R. B., Lal A. K., Pati S.
doaj +1 more source