Square of an oriented graph
Date of Publication
2016
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/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.
Abstract Format
html
Language
English
Format
Electronic
Accession Number
CDTU021104
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Keywords
Directed graphs; Graph algorithms
Recommended Citation
Macariola, F., & Serapio, A. (2016). Square of an oriented graph. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/18394
