The Sylvester graph and Moore graphs.
Aleksandar JurisicJanos VidaliPublished in: Eur. J. Comb. (2019)
Keyphrases
- graph representation
- graph structure
- graph theory
- directed graph
- graph matching
- graph construction
- graph databases
- weighted graph
- graph model
- labeled graphs
- graph theoretic
- graph classification
- graph structures
- adjacency matrix
- graph theoretical
- graph search
- graph properties
- undirected graph
- graph clustering
- graph partitioning
- bipartite graph
- random graphs
- graph isomorphism
- series parallel
- graph representations
- graph kernels
- subgraph isomorphism
- structural pattern recognition
- graph data
- graph mining
- connected dominating set
- graph transformation
- graph edit distance
- maximum clique
- maximum common subgraph
- disk resident
- evolving graphs
- adjacency graph
- finding the shortest path
- structured data
- query graph
- spanning tree
- dominating set
- average degree
- social graphs
- inexact graph matching
- topological information
- fully connected
- graph drawing
- dynamic graph
- edge weights
- dense subgraphs
- real world graphs
- neighborhood graph
- spectral decomposition
- random walk
- directed acyclic
- massive graphs
- social networks
- planar graphs
- community discovery
- web graph
- polynomial time complexity
- graph patterns
- frequent subgraphs
- shortest path
- maximum independent set
- directed acyclic graph
- connected graphs
- minimum spanning tree
- relational graph
- graph embedding
- maximal cliques
- bounded degree
- bounded treewidth
- association graph
- independent set