Cubic graphs on twelve vertices and the line graph of a finite affine plane.
Arthur PellerinRenu C. LaskarPublished in: Discret. Math. (1975)
Keyphrases
- labeled graphs
- weighted graph
- adjacency matrix
- undirected graph
- random graphs
- edge weights
- graph representation
- query graph
- connected graphs
- attributed graphs
- average degree
- directed graph
- graph structure
- hamiltonian cycle
- planar graphs
- graph model
- maximal cliques
- directed edges
- maximum cardinality
- vertex set
- graph theory
- graph theoretic
- bipartite graph
- graph structures
- graph clustering
- subgraph isomorphism
- graph kernels
- graph partitioning
- connected subgraphs
- minimum weight
- graph databases
- graph matching
- graph data
- graph mining
- graph properties
- graph construction
- graph classification
- topological information
- shortest path
- spanning tree
- random walk
- maximum clique
- structural pattern recognition
- graph isomorphism
- graph theoretical
- dynamic graph
- maximum common subgraph
- graph representations
- graph search
- graph patterns
- betweenness centrality
- reachability queries
- complex networks
- phase transition
- finding the shortest path
- b spline
- graph mining algorithms
- affine transformation
- graph layout
- minimum cost
- small world
- minimum spanning tree
- community discovery