Results 61 to 70 of about 1,687,821 (139)
MagNet: A Neural Network for Directed Graphs. [PDF]
Adv Neural Inf Process Syst, 2021 Zhang X +4 more
europepmc +1 more source
Figure illustrating usage of adjacency matrix for handling network connectivity.
, 2016 (A) Neuronal network consisting of 5 excitatory and inhibitory neurons, represented by tan and blue colors, respectively. (B) Adjacency matrix depicting the connectivity among neurons in network shown in (A).
Hiroshi Someya (2735467) +4 more
core +1 more source
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
Strongly Regular Graphs with Maximal Energy [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core
Graph Matching using Adjacency Matrix Markov Chains
, 2001 Graph Matching using Adjacency Matrix Markov ...
Antonio Robles-Kelly (13058748) +1 more
core
Adjacency Matrix of Product of Graphs
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.
Urvashi Acharya, Himali Mehta
core +1 more source
The Maximum Order of Reduced Square(0, 1)-Matrices with a Given Rank [PDF]
We look for the maximum order of a square (0, 1)-matrix A with a fixed rank r, provided A has no repeated rows or columns. If A is the adjacency matrix of a graph, Kotlov and Lovász [J. Graph Theory 23, 1996] proved that the maximum order equals Θ(2r/2).
Peeters, M.J.P., Haemers, W.H.
core
Quantum walk processes in quantum devices. [PDF]
Heliyon, 2023 Madhu AK +4 more
europepmc +1 more source
Centrality measures for directed graphs with Hermitian adjacency matrices and Path-Sums method
, 2020 Η παρούσα Διπλωματική Εργασία διαπραγματεύεται το ζήτημα του υπολογισμού της κεντρικότητας κόμβων κατευθυνόμενων γραφημάτων βάσει πρόσφατων τεχνικών που δεν έχουν διερευνηθεί επαρκώς στη βιβλιογραφία.
Καρακίτσου, Ελευθερία-Σοφία
core