Affine extensions of the petersen graph and 2-arc-transitive graphs of girth 5.
Dmitrii V. PasechnikPublished in: Eur. J. Comb. (1992)
Keyphrases
- graph kernels
- graph representation
- graph theory
- graph structure
- graph matching
- labeled graphs
- directed graph
- weighted graph
- adjacency matrix
- graph databases
- graph mining
- graph classification
- graph theoretic
- graph clustering
- graph theoretical
- graph construction
- graph structures
- series parallel
- graph partitioning
- subgraph isomorphism
- graph properties
- graph model
- bipartite graph
- graph data
- random graphs
- graph representations
- spanning tree
- dynamic graph
- maximum cardinality
- graph search
- directed acyclic
- reachability queries
- adjacency graph
- minimum spanning tree
- average degree
- structural pattern recognition
- planar graphs
- connected dominating set
- undirected graph
- edge weights
- structured data
- evolving graphs
- polynomial time complexity
- graph transformation
- graph isomorphism
- finding the shortest path
- graph patterns
- graph embedding
- maximum common subgraph
- maximum clique
- inexact graph matching
- web graph
- real world graphs
- graph layout
- graph drawing
- affine transformation
- dense subgraphs
- random walk
- maximal cliques
- proximity graph
- social graphs
- maximum independent set
- strongly connected
- np complete
- quasi cliques
- massive graphs
- connected components
- phase transition
- query graph
- frequent subgraphs
- association graph
- attributed graphs
- topological information