Enumerating typical abelian prime-fold coverings of a circulant graph.
Rongquan FengJin Ho KwakYoung Soo KwonPublished in: Discret. Math. (2009)
Keyphrases
- graph theory
- graph representation
- directed graph
- fourier transform
- spanning tree
- graph matching
- least squares
- weighted graph
- bipartite graph
- graph structure
- connected components
- graph model
- graph partitioning
- graph clustering
- discrete fourier transform
- graph structures
- graph mining
- structured data
- data mining
- graph based algorithm