On distance and size of Eulerian and bipartite digraphs
Date of Publication
2016
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics with specialization in Business Applications
Subject Categories
Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Yvette F. Lim
Abstract/Summary
This study is an exposition of the paper by Peter Dankelmann [3], entitled Distance and Size in Digraphs published in Discrete Mathematics last September 26, 2014. We will provide a detailed proof to determine the maximum size of an Eulerian digraph of given order and diameter as published in this paper. Also, details for determining the maximum size of a bipartite digraph of given order and radius will be provided.
Abstract Format
html
Language
English
Format
Electronic
Accession Number
CDTU020642
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
1 computer disc ; 4 3/4 in.
Keywords
Eulerian graph theory; Graph theory; Directed graphs; Bipartite graphs
Recommended Citation
Ong, S. A., & Entero, M. C. (2016). On distance and size of Eulerian and bipartite digraphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/14922
Embargo Period
5-11-2021
