From the Spectrum of the Adjacency Matrix to the Spectrum of Directed Edge Matrix: Counting Cycles of a Bipartite Graph Through a Simple Equation.
Ali DehghanAmir H. BanihashemiPublished in: ITW (2019)
Keyphrases
- bipartite graph
- adjacency matrix
- graph clustering
- graph model
- weighted graph
- eigenvalues and eigenvectors
- graph matching
- undirected graph
- graph representation
- singular value decomposition
- edge weights
- positive definite
- directed graph
- maximum cardinality
- social networks
- covariance matrix
- vector space
- supervised learning
- pattern recognition