Searching Isomorphic Graphs

Journal Title: Transactions on Networks and Communications - Year 2017, Vol 5, Issue 5

Abstract

To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same mutual positioning of vertices. Obviously, if the given graphs are isomorphic, then such equivalent digraphs exist. Proceeding from the arrangement of vertices in one of the digraphs, we try to determine the corresponding vertices in another digraph. As a result we develop the algorithm for constructing a bijective mapping between vertices of the given graphs if they are isomorphic. The running time of the algorithm equal to 􀀁(􀀃􀀄), where n is the number of graph vertices.

Authors and Affiliations

Anatoly D. Plotnikov

Keywords

Related Articles

Achieving Scalability with Data Owner Anonymity in Cloud Access Control

Cloud computing is a trending technology that enables subscribing organizations to outsource computations and storage, and eliminates the need of purchasing and maintaining the equipment by the organizations themselves....

Cryptography and Steganography: New Approach

Digital communication witnesses a noticeable and continuous development in many applications in the Internet. Hence, secure communication sessions must be provided. The security of data transmitted across a global networ...

Exploiting Cryptocurrency Miners with OSINT Techniques

Collection of intelligence is one of the key elements to organize more sophisticated methods of attacks. Open Source Intelligence (OSINT) is a technique used by attackers for reconnaissance purposes to gather information...

Performance Evaluation of Multi‐hop Wireless HART Network on a Real‐life Testbed

Advances in WirelessHART standard in industrial control systems have led to performance evaluation and security analysis in both real‐world testbeds as well as in controlled lab environments. We have conducted months‐lon...

An IOT-enabled System for Marine Data Acquisition and Cartography

Current satellite communication remains very expensive and impractical for most small to mid-sized vessels, and at the same time marine wireless networking is lack of network coverage. To solve this problem, this paper p...

Download PDF file
  • EP ID EP273962
  • DOI 10.14738/tnc.55.3551
  • Views 53
  • Downloads 0

How To Cite

Anatoly D. Plotnikov (2017). Searching Isomorphic Graphs. Transactions on Networks and Communications, 5(5), 39-54. https://europub.co.uk/articles/-A-273962