The automorphism groups of non-edge-transitive rose window graphs.
Ted DobsonIstván KovácsStefko MiklavicPublished in: Ars Math. Contemp. (2015)
Keyphrases
- weighted graph
- undirected graph
- densely connected
- minimum spanning trees
- adjacency graph
- edge detection
- graph theory
- edge information
- graph representation
- edge weights
- graph mining
- series parallel
- graph matching
- graph partitioning
- window size
- transitive closure
- small world
- graph kernels
- vertex set
- sliding window
- shortest path