Author Login IJIRT Partner Network (IPN) Login

SOME REALIZABLE AND NONREALIZABLE LATTICE OF CONVEX EDGE SETS.

  • Unique Paper ID: 157080
  • Volume: 9
  • Issue: 6
  • PageNo: 88-92
  • 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.
Download article email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 9
  • Issue: 6
  • PageNo: 88-92

SOME REALIZABLE AND NONREALIZABLE LATTICE OF CONVEX EDGE SETS.

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry