SOME REALIZABLE AND NONREALIZABLE LATTICE OF CONVEX EDGE SETS.

SOME REALIZABLE AND NONREALIZABLE LATTICE OF CONVEX EDGE SETS.
Author(s):
Dr. Asha Saraswathi B.
Keywords:
Lattices, Chains, Connected digraphs, Convex edge sets MSC: 06B99, 05C20, 05C38
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.
Article Details
Unique Paper ID: 157080 Publication Volume & Issue: Volume 9, Issue 6 Page(s): 88 - 92
Article Preview & Download

Share This Article

NCSST-2021

AICTE Sponsored National Conference on Smart Systems and Technologies

Last Date: 25th November 2021

LATEST INNOVATION’S AND FUTURE TRENDS IN MANAGEMENT

Last Date: 7th November 2021

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org