Combinatorics and Graph Theory


Defining a Modified Adjacency Value Product Following Unique Prime Labeling of Graph Vertices and Undertaking a Small Step Toward Possible Application for Testing Graph Isomorphism

Authors: Prashanth R. Rao

In a previous paper we described a method to represent graph information as a single numerical value by distinctly labeling each of its vertices with unique primes. In this paper, we modify the previous approach to again represent a graph as a single numeric value, we log transform this value and approximate it with an optimum value which if minimized by appropriate prime labeling of the graph should allow us to compare it with another graph on which an identical algorithm is implemented. Identical optimum value minima is a necessary but not sufficient condition for graph isomorphism.

Comments: 3 Pages.

Download: PDF

Submission history

[v1] 2016-01-18 09:45:28
[v2] 2016-01-20 19:35:39
[v3] 2016-01-30 07:39:24

Unique-IP document downloads: 70 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus