On the construction of the self-complementary graphs on 12 nodes.
Marg KroparRonald C. ReadPublished in: J. Graph Theory (1979)
Keyphrases
- directed graph
- graph structure
- undirected graph
- random graphs
- graph structures
- weighted graph
- adjacency matrix
- spanning tree
- construction process
- planar graphs
- fully connected
- real world networks
- labeled trees
- graph mining
- real world graphs
- small world
- average degree
- attributed graphs
- connected graphs
- graph partitioning
- shortest path
- graph matching
- random walk
- finding the shortest path
- graph theoretic
- graph theory
- link prediction
- strongly connected
- complex networks
- graphical structure
- network structure
- betweenness centrality
- np complete