On distance and size of Eulerian and bipartite digraphs

On distance and size of Eulerian and bipartite digraphs

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 p...

Full description

Saved in:
Bibliographic Details
Main Authors: Ong, Symoun Israel A., Entero, Michael C.
Format: text
Language:English
Published: Animo Repository 2016
Subjects:
Eulerian graph theory
Graph theory
Directed graphs
Bipartite graphs
Mathematics
Online Access:https://animorepository.dlsu.edu.ph/etd_bachelors/14922
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
Description
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.

Similar Items