Cubic graphs without cut-vertices having the same path layer matrix.
Andrey A. DobryninPublished in: J. Graph Theory (2001)
Keyphrases
- adjacency matrix
- planar graphs
- weighted graph
- vertex set
- edge weights
- undirected graph
- graph matching
- shortest path
- graph representation
- eigenvalues and eigenvectors
- labeled graphs
- normalized cut
- attributed graphs
- random graphs
- hamiltonian cycle
- directed graph
- graph clustering
- multi layer
- strongly connected
- maximum cardinality
- graph partitioning
- positive definite
- minimum weight
- minimum cost
- average degree
- endpoints
- query graph
- singular value decomposition
- connected subgraphs
- subgraph isomorphism
- optimal path
- graph theoretic
- bipartite graph
- spectral decomposition
- b spline