Author:
Haff C. E.,Murty U. S. R.,Wilton R. C.
Abstract
Let (P, ≥) be a p.o. set. The basis graph of (P, ≥) is defined to be the directed graph whose vertex set is P and in which the ordered pair 〈a, b〉 is an edge if and only if b covers a in (P, ≥).Let D be a directed graph. All graphs considered in this note are finite and are free of loops and multiple edges.
Publisher
Canadian Mathematical Society
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On graphs that can be oriented as diagrams of ordered sets;Order;1985
2. The Diagram;Graphs and Order;1985
3. Introduction;Graphs and Order;1985
4. A characterization of hypercubes;Discrete Mathematics;1977
5. Graph theory;Journal of Soviet Mathematics;1974