Special Graphs of Euler’s Family* and Tracing Algorithm- (A New Approach)

Abstract

There are in graph theory, some known graphs which date back from centuries. [Euler graph, Hamiltonian graph etc.] These graphs are basic roots for development of graph theory. In this paper we have discussed the novel concept of tracing Euler tour. It depends on the concept of Link vertex - a join vertex of finite number of cycles as components of Euler graph. In addition to this, a new notion of isomorphic transformation of given graph on to a given line segment known as ‘Linear Graph’ also plays an important role for tracing the Euler graph.