Search Results

You are looking at 1 - 2 of 2 items for

  • Author or Editor: K. Khashyarmanesh x
  • Refine by Access: All Content x
Clear All Modify Search
Restricted access

Abstract

We associate a graph G (P) to a partially ordered set (poset, briefly) with the least element 0, as an undirected graph with vertex set P =P∖{0} and, for two distinct vertices x and y, x is adjacent to y in G (P) if and only if {x,y} ={0}, where, for a subset S of P, S is the set of all elements xP with xs for all sS. We study some basic properties of G (P). Also, we completely investigate the planarity of G (P).

Restricted access