Spectral Theory of Graphs in Chemistry. 1. Projection Operators and Canonical Numeration of Graph Vertices.
Ivan V. StankevichElena G. Gal'pernAnatolii L. ChistyakovIgor I. BaskinMariya I. SkvortsovaNikolai S. ZefirovOleg B. TomilinPublished in: J. Chem. Inf. Comput. Sci. (1994)
Keyphrases
- labeled graphs
- weighted graph
- adjacency matrix
- undirected graph
- random graphs
- graph matching
- attributed graphs
- planar graphs
- spectral decomposition
- graph theory
- directed graph
- edge weights
- graph structure
- hamiltonian cycle
- graph representation
- average degree
- laplacian matrix
- connected graphs
- directed edges
- connected subgraphs
- maximum cardinality
- graph partitioning
- normalized cut
- maximal cliques
- graph databases
- graph theoretic
- graph model
- graph construction
- graph structures
- bipartite graph
- query graph
- random walk
- graph mining
- graph properties
- graph search
- graph clustering
- vertex set
- spanning tree
- minimum spanning tree
- graph kernels
- minimum weight
- graph theoretical
- graph data
- structural pattern recognition
- densely connected
- connected components
- graph representations
- subgraph isomorphism
- spectral methods
- betweenness centrality
- bounded treewidth
- graph patterns
- reachability queries
- graph laplacian
- dense subgraphs
- polynomial time complexity
- graph isomorphism
- real world graphs
- directed acyclic graph
- complex networks
- shortest path