In the graph theory, two graphs are said to be isomorphic if there is a one-one, onto mapping defined between their set of vertices so as to preserving the adjacency between vertices. An isomorphism defined on a vertex set of a graph to itself is called automorphism of the given graph. Two vertices in a graph are said to be similar if there is an automorphism defined on its vertex set mapping one vertex to the other. In this paper, it has been discussed that every such automorphism defines an equivalence relation on the set of vertices and the number of equivalence classes is same as the number of rotations that the automorphism makes on the vertex set. The set of all automorphisms of a graph is a permutation group under the composition of permutations. This group is called automorphism group of the graph. A graph is said to be vertex transitive if its automorphism group acts transitively on its vertex set. The path degree sequence of a vertex in a graph is the list of lengths of paths having this particular vertex as initial vertex. The ordered set of all such sequences is called path degree sequence of the graph. It is conjectured that two graphs are isomorphic iff they have same path degree sequence. In this paper, it has been discussed that this conjecture holds good when both the graphs are vertex transitive. The notion of functional graph has been introduced in this paper. The functional graph of any two isomorphic graphs is a graph in which the vertex set is the union of vertex sets of isomorphic graphs and two vertices are connected by an edge iff they are connected in any one of the graph when they belong to the same graph or one vertex is the image of the other under the given isomorphism when they are in different set of vertices. It has been proved that the functional graphs obtained from two isomorphic complete bipartite graphs are vertex transitive. Keywords : graph automorphism ; functional graph ; vertex transitive graph ; path degree sequence.

**Comments:** 9 Pages. The last theorem is the highlight of the paper

**Download:** **PDF**

[v1] 2017-11-09 01:59:34

**Unique-IP document downloads:** 33 times

Vixra.org 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. Vixra.org 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. *