Cubic graphs with 62 vertices having the same path layer matrix.
Andrey A. DobryninPublished in: J. Graph Theory (1993)
Keyphrases
- adjacency matrix
- weighted graph
- eigenvalues and eigenvectors
- edge weights
- shortest path
- labeled graphs
- graph representation
- undirected graph
- graph matching
- random graphs
- attributed graphs
- directed graph
- hamiltonian cycle
- singular value decomposition
- graph partitioning
- graph theoretic
- maximal cliques
- application layer
- spectral decomposition
- laplacian matrix
- positive definite
- graph clustering
- spanning tree
- linear algebra
- average degree
- maximum cardinality
- finding the shortest path
- graph model
- betweenness centrality
- planar graphs
- strongly connected
- symmetric matrices
- query graph
- low rank
- graph theory
- multi layer
- optimal path
- connected subgraphs
- connected graphs
- densely connected
- vertex set
- minimum weight
- bipartite graph
- matrix factorization
- complex networks
- covariance matrix
- b spline