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:
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
id oai:animorepository.dlsu.edu.ph:etd_bachelors-6253
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-62532021-05-12T02:37:42Z On distance and size of Eulerian and bipartite digraphs Ong, Symoun Israel A. Entero, Michael C. 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. 2016-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/14922 Bachelor's Theses English Animo Repository Eulerian graph theory Graph theory Directed graphs Bipartite graphs Mathematics
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
language English
topic Eulerian graph theory
Graph theory
Directed graphs
Bipartite graphs
Mathematics
spellingShingle Eulerian graph theory
Graph theory
Directed graphs
Bipartite graphs
Mathematics
Ong, Symoun Israel A.
Entero, Michael C.
On distance and size of Eulerian and bipartite digraphs
description 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.
format text
author Ong, Symoun Israel A.
Entero, Michael C.
author_facet Ong, Symoun Israel A.
Entero, Michael C.
author_sort Ong, Symoun Israel A.
title On distance and size of Eulerian and bipartite digraphs
title_short On distance and size of Eulerian and bipartite digraphs
title_full On distance and size of Eulerian and bipartite digraphs
title_fullStr On distance and size of Eulerian and bipartite digraphs
title_full_unstemmed On distance and size of Eulerian and bipartite digraphs
title_sort on distance and size of eulerian and bipartite digraphs
publisher Animo Repository
publishDate 2016
url https://animorepository.dlsu.edu.ph/etd_bachelors/14922
_version_ 1772834754005041152