Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{157080,
        author = {Dr. Asha Saraswathi B.},
        title = {SOME REALIZABLE AND NONREALIZABLE LATTICE OF CONVEX EDGE SETS.},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {9},
        number = {6},
        pages = {88-92},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=157080},
        abstract = {Let G be a connected directed graph and E(G) be the directed edge set of G. A subset C of E(G) is said to be convex if for any  , there is a directed path containing  and the edge set of every  geodesic is contained in C. Let Con(G) be the set of all convex edge sets of G together with empty set partial ordered by set inclusion  relation. Then Con(G) forms a lattice if and only if G has an Euler trial. In this paper some realizable and nonrealizable lattice of convex edge sets is discussed.},
        keywords = {Lattices, Chains, Connected digraphs, Convex edge sets
MSC: 06B99, 05C20, 05C38},
        month = {},
        }