Abstract

In this paper Trail set is defined for a finite connected graph G and it is found that the set of all trail sets ȶ(G) together with empty set partially ordered by set inclusion relation forms a lattice. Also derived graph of G, denoted by Gd is defined such that lattices ȶ(G) and ȶ(Gd) are isomorphic. Some of the properties of the lattices so obtained are studied. The definition of trail sets is extended to directed graphs and studied.

Keywords

References

[1] Asha Saraswathi B. and Lavanya S., On the Lattice of Convex Edge sets of a Connected directed graph., International Journal of Pure and Applied Mathematical Sciences. Volume 8, Number 2(2015),pp.155-161
[2] Asha Saraswathi B. and Lavanya S., Some Properties Of The Lattice Of Convex Edge Sets Of A Connected Directed Graph., International Journal of Scientific & Engineering Research Volume 8, Issue 5, May 2017,1-3
[3] Birkhoff. G. Lattice theory, Third edition (New York, 1967)
[4] Gratzer, G: General lattice theory, BirkhauserVerlag, academic press, 1978
[5] Harary F: Graph theory, Addision-wesley 1969
[6] D. Kelly and I. Rival, Planar lattices, CanadJ. Math, 27 No. 3, (1975), 636-665
[7] Lavanya S. and Subramanya Bhat S., On the lattice of convex sets of a connected graph, Global journal of pure and applied Mathematics, Vol 7, 2(2011), 157-162
[8] Lavanya S., On the lattice of path sets of a connected graph, Indian Journal of Mathematics research, Vol. 1, No.2 (2013), 219-222.
[9] Pfaltz. J. L., Convexity in directed graphs, J. Combinatorial theory 10(1971), 143-162.