Vertex-imprimitive symmetric graphs with exactly one edge between any two distinct blocks.
Teng FangXin Gui FangBinzhou XiaSanming ZhouPublished in: J. Comb. Theory, Ser. A (2017)
Keyphrases
- undirected graph
- vertex set
- edge weights
- weighted graph
- directed graph
- strongly connected
- spanning tree
- minimum weight
- labeled graphs
- attributed graphs
- approximation algorithms
- graph structure
- directed acyclic graph
- complex networks
- maximum cardinality
- minimum cost
- graph matching
- random graphs
- minimum spanning trees
- average degree
- graph representation
- bipartite graph
- edge information
- random walk
- connected subgraphs
- edge detection
- graph theoretic
- graph mining
- graph clustering
- connected components
- gray level
- hamiltonian cycle