On graph isomorphism and graph automorphism

1991 ◽  
Vol 8 (1) ◽  
pp. 19-37 ◽  
Author(s):  
Tomislav P. Zivković
Keyword(s):  
Graph Isomorphism ◽  
Graph Automorphism

scholarly journals Optinalysis: Isometric Isomorphism and Automorphism Through A Looking-Glass

2020 ◽  
Author(s):  
Kabir Bindawa Abdullahi
Keyword(s):  
Efficient Algorithm ◽  
Unsolved Problem ◽  
Graph Isomorphism ◽  
Graph Automorphism ◽  
Graph Models ◽  
Isometric Isomorphism ◽  
Looking Glass

Measures of graph symmetry, similarity, and identity have been extensively studied in graph automorphism and isomorphism detection problems. Nevertheless, graph isomorphism detection remains an open (unsolved) problem for many decades. In this paper, a new and efficient methodological paradigm, called optinalysis, is proposed for symmetry detections, similarity, and identity measures between isometric isomorphs or automorphs. Optinalysis is explained and expressed in clearly stated definitions and prove theorems, which conform to the definitions and theorems of isometry, isomorphism, and automorphism. Analogous to the polynomiality formalization for an efficient algorithm for graph isomorphism detection, optinalysis is however deterministic on polynomial and non-polynomial graph models.

scholarly journals A Moment-Based Method of Optinalysis

2020 ◽  
Author(s):  
Kabir Bindawa Abdullahi
Keyword(s):  
Unsolved Problem ◽  
Graph Isomorphism ◽  
Test Results ◽  
Symmetry Detection ◽  
Graph Automorphism ◽  
Graph Models ◽  
Moment Coefficient

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.

scholarly journals Research on Blockchain-Based E-Bidding System

2021 ◽  
Vol 11 (9) ◽  
pp. 4011
Author(s):  
Dan Wang ◽  
Jindong Zhao ◽  
Chunxiao Mu
Keyword(s):  
Data Transmission ◽  
Privacy Protection ◽  
Graph Isomorphism ◽  
Third Party ◽  
Business Logic ◽  
Core Concept ◽  
The Core ◽  
Blockchain Technology ◽  
Smart Contract ◽  
Bidding Process

In the field of modern bidding, electronic bidding leads a new trend of development, convenience and efficiency and other significant advantages effectively promote the reform and innovation of China’s bidding field. Nowadays, most systems require a strong and trusted third party to guarantee the integrity and security of the system. However, with the development of blockchain technology and the rise of privacy protection, researchers has begun to emphasize the core concept of decentralization. This paper introduces a decentralized electronic bidding system based on blockchain and smart contract. The system uses blockchain to replace the traditional database and uses chaincode to process business logic. In data interaction, encryption techniques such as zero-knowledge proof based on graph isomorphism are used to improve privacy protection, which improves the anonymity of participants, the privacy of data transmission, and the traceability and verifiable of data. Compared with other electronic bidding systems, this system is more secure and efficient, and has the nature of anonymous operation, which fully protects the privacy information in the bidding process.

scholarly journals MET: a Java package for fast molecule equivalence testing

2020 ◽  
Vol 12 (1) ◽  
Author(s):  
Jördis-Ann Schüler ◽  
Steffen Rechner ◽  
Matthias Müller-Hannemann
Keyword(s):  
Chemical Properties ◽  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Equivalence Classes ◽  
Equivalence Testing ◽  
Equivalence Test ◽  
Graph Isomorphism Problem ◽  
2D Structure ◽  
Node Labels ◽  
Labelled Graphs

AbstractAn important task in cheminformatics is to test whether two molecules are equivalent with respect to their 2D structure. Mathematically, this amounts to solving the graph isomorphism problem for labelled graphs. In this paper, we present an approach which exploits chemical properties and the local neighbourhood of atoms to define highly distinctive node labels. These characteristic labels are the key for clever partitioning molecules into molecule equivalence classes and an effective equivalence test. Based on extensive computational experiments, we show that our algorithm is significantly faster than existing implementations within , and . We provide our Java implementation as an easy-to-use, open-source package (via GitHub) which is compatible with . It fully supports the distinction of different isotopes and molecules with radicals.

scholarly journals Graph isomorphism restricted by lists

2021 ◽  
Vol 860 ◽  
pp. 51-71
Author(s):  
Pavel Klavík ◽  
Dušan Knop ◽  
Peter Zeman
Keyword(s):  
Graph Isomorphism

scholarly journals Isomorphism, canonization, and definability for graphs of bounded rank width

2021 ◽  
Vol 64 (5) ◽  
pp. 98-105
Author(s):  
Martin Grohe ◽  
Daniel Neuen
Keyword(s):  
Fixed Point ◽  
Complexity Theory ◽  
Polynomial Time ◽  
Graph Isomorphism ◽  
Isomorphism Problem ◽  
Descriptive Complexity ◽  
Graph Isomorphism Problem ◽  
Structural Graph ◽  
Graph Classes ◽  
Bounded Rank

We investigate the interplay between the graph isomorphism problem, logical definability, and structural graph theory on a rich family of dense graph classes: graph classes of bounded rank width. We prove that the combinatorial Weisfeiler-Leman algorithm of dimension (3 k + 4) is a complete isomorphism test for the class of all graphs of rank width at most k. A consequence of our result is the first polynomial time canonization algorithm for graphs of bounded rank width. Our second main result addresses an open problem in descriptive complexity theory: we show that fixed-point logic with counting expresses precisely the polynomial time properties of graphs of bounded rank width.

Sign in / Sign up

Export Citation Format

Share Document