Square of an oriented graph
In 1993, Paul Seymour posed the problem that for every oriented graph D there exists a vertex whose out-degree at least doubles when you square the oriented graph. We verify this claim for some families of graphs namely paths, cycles and star graph. Further, we will identify other vertices that will...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2016
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/18394 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | In 1993, Paul Seymour posed the problem that for every oriented graph D there exists a vertex whose out-degree at least doubles when you square the oriented graph. We verify this claim for some families of graphs namely paths, cycles and star graph. Further, we will identify other vertices that will satisfy assertion of the Square of Oriented Graph Conjecture. |
|---|