Invariant Graph Partition Comparison Measures

Invariant Graph Partition Comparison Measures

Symmetric graphs have non-trivial automorphism groups. This article starts with the proof that all partition comparison measures we have found in the literature fail on symmetric graphs, because they are not invariant with regard to the graph automorphisms. By the construction of a pseudometric spac...

Full description

Bibliographic Details
Main Authors: Fabian Ball, Andreas Geyer-Schulz
Format: Article
Language:English
Published: MDPI AG 2018-10-01
Series:Symmetry
Subjects:
graph partitioning
graph clustering
invariant measures
partition comparison
finite automorphism groups
graph automorphisms
Online Access:http://www.mdpi.com/2073-8994/10/10/504

Internet

http://www.mdpi.com/2073-8994/10/10/504

Similar Items