Characterization of graphs which admit vertex-transitive embeddings.
Jozef SiránThomas W. TuckerPublished in: J. Graph Theory (2007)
Keyphrases
- directed graph
- undirected graph
- attributed graphs
- labeled graphs
- hamiltonian cycle
- graph theory
- graph matching
- vector space
- edge weights
- dimensionality reduction
- vertex set
- connected subgraphs
- data sets
- maximum cardinality
- graph databases
- graph clustering
- graph representation
- weighted graph
- high dimensional data
- low dimensional
- pattern recognition
- graph partitioning
- bipartite graph
- manifold learning
- graph kernels
- graph construction
- random walk
- semi supervised
- betweenness centrality
- average degree
- query processing