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
Join our RMS
Conference Alert
NCSEM 2024
National Conference on Sustainable Engineering and Management - 2024