The edge-transitive but not vertex-transitive cubic graph on 112 vertices.
Marston D. E. ConderAleksander MalnicDragan MarusicTomaz PisanskiPrimoz PotocnikPublished in: J. Graph Theory (2005)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- minimum weight
- directed acyclic graph
- transitive closure
- directed graph
- labeled graphs
- spanning tree
- hamiltonian cycle
- attributed graphs
- maximum cardinality
- strongly connected
- bipartite graph
- graph structure
- shortest path
- random graphs
- adjacency matrix
- minimum spanning tree
- average degree
- connected components
- minimum cost
- graph model
- disjoint paths
- graph clustering
- complex networks
- graph partitioning
- graph representation
- graph structures
- betweenness centrality
- edge information
- connected subgraphs
- preference relations