| dc.creator |
Civan, Yusuf |
|
| dc.date |
2013-06-30T21:00:00Z |
|
| dc.date.accessioned |
2020-10-06T10:33:28Z |
|
| dc.date.available |
2020-10-06T10:33:28Z |
|
| dc.identifier |
7c725f0e-1754-4f4c-bf59-3ae379c79aed |
|
| dc.identifier |
10.1007/s11083-012-9270-4 |
|
| dc.identifier |
https://avesis.sdu.edu.tr/publication/details/7c725f0e-1754-4f4c-bf59-3ae379c79aed/oai |
|
| dc.identifier.uri |
http://acikerisim.sdu.edu.tr/xmlui/handle/123456789/64324 |
|
| dc.description |
We introduce and study a class of simple graphs, the upper-maximal graphs (UM-graphs), associated to finite posets. The vertices of the UM-graph of a given poset P are the elements of P, and edges are formed by those vertices x and y whenever any maximal element of P that is greater than x is also greater than y or vise versa. We show that the class of UM-graphs constitutes a subclass of comparability graphs. We further provide a characterization of chordal UM-graphs, and compare UM-graphs with known bound graphs of posets. |
|
| dc.language |
eng |
|
| dc.rights |
info:eu-repo/semantics/closedAccess |
|
| dc.title |
Upper Maximal Graphs of Posets |
|
| dc.type |
info:eu-repo/semantics/article |
|