Article
Version 1
Preserved in Portico This version is not peer-reviewed
A Moment-Based Method of Optinalysis
Version 1
: Received: 9 August 2020 / Approved: 10 August 2020 / Online: 10 August 2020 (06:29:58 CEST)
How to cite: Abdullahi, K.B. A Moment-Based Method of Optinalysis. Preprints 2020, 2020080239. https://doi.org/10.20944/preprints202008.0239.v1 Abdullahi, K.B. A Moment-Based Method of Optinalysis. Preprints 2020, 2020080239. https://doi.org/10.20944/preprints202008.0239.v1
Abstract
Graph symmetry detection, similarity, and identity measures have been extensively studied in graph automorphism and isomorphism problems. Nevertheless, graph isomorphism and automorphism detection remain an open (unsolved) problem for many decades. In this paper, a new optinalytic coefficient termed as an optical moment coefficient was introduced for optinalysis. Its characteristic efficiency was tested for bijective property, invariance, deterministic polynomiality and non-polynomiality. The test results show that the new optical moment coefficient is very efficient for symmetry detections, similarity and identity measures between two isometric isomorphs and automorphs; and deterministic on polynomial and non-polynomial graph models.
Keywords
Automorphism; Identity; Isometry; Isomorphism; Similarity; Symmetry
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
