Results 41 to 50 of about 2,858,268 (305)
On a version of the spectral excess theorem
Electronic Journal of Graph Theory and Applications, 2020 Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic (or ...
Miquel Àngel Fiol, Safet Penjic
doaj +1 more source
Spectra of the neighbourhood corona of two graphs
, 2013 Given simple graphs $G_1$ and $G_2$, the neighbourhood corona of $G_1$ and $G_2$, denoted $G_1\star G_2$, is the graph obtained by taking one copy of $G_1$ and $|V(G_1)|$ copies of $G_2$, and joining the neighbours of the $i$th vertex of $G_1$ to every ...
Liu, Xiaogang, Zhou, Sanming
core +1 more source
Spectrum of Adjacency Matrix of Graphs in Cryptography
, 2023 Abstract Having access to an elliptic curve with a specified number of points over a specific finite field isa prerequisite for many contemporary cryptography systems. The isogenies, which are surjectivemorphisms, play a significant role as specific mappings between these curves.
openaire +1 more source
The Aα-spectral radius of complements of bicyclic and tricyclic graphs with n vertices
Special Matrices, 2021 Recently, the extremal problem of the spectral radius in the class of complements of trees, unicyclic graphs, bicyclic graphs and tricyclic graphs had been studied widely.
Chen Chaohui +2 more
doaj +1 more source
Ural Mathematical Journal, 2021 The vertex distance complement (VDC) matrix \(\textit{C}\), of a connected graph \(G\) with vertex set consisting of \(n\) vertices, is a real symmetric matrix \([c_{ij}]\) that takes the value \(n - d_{ij}\) where \(d_{ij}\) is the distance between the
Ann Susa Thomas +2 more
doaj +1 more source
Adjacency spectra of random and complete hypergraphs
, 2020 We present progress on the problem of asymptotically describing the adjacency eigenvalues of random and complete uniform hypergraphs. There is a natural conjecture arising from analogy with random matrix theory that connects these spectra to that of the ...
Joshua N. Cooper
semanticscholar +1 more source
On the Spectral Characterizations of Graphs
Discussiones Mathematicae Graph Theory, 2017 Several matrices can be associated to a graph, such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question “Which graphs are determined by their spectrum?”
Huang Jing, Li Shuchao
doaj +1 more source
Spectrum-based Deep Neural Networks for Fraud Detection [PDF]
International Conference on Information and Knowledge Management, 2017 In this paper, we focus on fraud detection on a signed graph with only a small set of labeled training data. We propose a novel framework that combines deep neural networks and spectral graph analysis. In particular, we use the node projection (called as
Shuhan Yuan +3 more
semanticscholar +1 more source
Identifying and characterizing nodes important to community structure using the spectrum of the graph. [PDF]
PLoS ONE, 2011 BackgroundMany complex systems can be represented as networks, and how a network breaks up into subnetworks or communities is of wide interest. However, the development of a method to detect nodes important to communities that is both fast and accurate ...
Yang Wang, Zengru Di, Ying Fan
doaj +1 more source
Node-Link or Adjacency Matrices: Old Question, New Insights
IEEE Transactions on Visualization and Computer Graphics, 2019 Visualizing network data is applicable in domains such as biology, engineering, and social sciences. We report the results of a study comparing the effectiveness of the two primary techniques for showing network data: node-link diagrams and adjacency ...
Mershack Okoe, R. Jianu, S. Kobourov
semanticscholar +1 more source