4-regular graphs without cut-vertices having the same path layer matrix.
Yuansheng YangXiaohui LinZhiqiang ChenWeiming LuPublished in: J. Graph Theory (2003)
Keyphrases
- adjacency matrix
- planar graphs
- weighted graph
- vertex set
- undirected graph
- labeled graphs
- random graphs
- edge weights
- eigenvalues and eigenvectors
- normalized cut
- graph matching
- shortest path
- attributed graphs
- graph representation
- graph clustering
- directed graph
- graph model
- graph partitioning
- maximum cardinality
- positive definite
- laplacian matrix
- hamiltonian cycle
- graph theory
- spectral decomposition
- average degree
- minimum cost
- graph theoretic
- connected subgraphs
- densely connected
- symmetric matrices
- finding the shortest path
- bipartite graph
- application layer
- multi layer
- optimal path
- spectral clustering
- approximation algorithms
- query graph
- subgraph isomorphism
- maximal cliques
- graph kernels
- neural network
- endpoints
- graph mining