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
The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph,...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...
Rapport interne.In this paper, we focus on convergence packet routing techniques in a network, obtai...
This study is an exposition of the paper by Peter Dankelmann [3], entitled Distance and Size in Digr...
Soares [J. Graph Theory 1992] showed that the well known upper bound 3 +1 n+ O(1) on the diamete...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
Let G be an Eulerian bipartite digraph with vertex partition sizes m,n.We prove the following Turán...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
AbstractIn this paper we consider the following problem: Among all bipartite digraphs with n vertice...
Simple proofs are given for results of Edwards concerning the size of the largest bipartite subgraph...
We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter ...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
AbstractA (d, D, D′, s)-digraph is a directed graph with diameter D and maximum out-degree d such th...
We study the (D;D) and (D;N) problems for double-step digraphs considering the unilateral distance, ...
SIGLETIB: RN 4052 (86419-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph,...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...
Rapport interne.In this paper, we focus on convergence packet routing techniques in a network, obtai...
This study is an exposition of the paper by Peter Dankelmann [3], entitled Distance and Size in Digr...
Soares [J. Graph Theory 1992] showed that the well known upper bound 3 +1 n+ O(1) on the diamete...
Abstract: In this thesis we study and investigate bounds on distance measures in graphs and digraphs...
Let G be an Eulerian bipartite digraph with vertex partition sizes m,n.We prove the following Turán...
AbstractIn the context of the degree/diameter problem for directed graphs, it is known that the numb...
AbstractIn this paper we consider the following problem: Among all bipartite digraphs with n vertice...
Simple proofs are given for results of Edwards concerning the size of the largest bipartite subgraph...
We study several extremal problems in graph labelling and in weak diameter of digraphs. In Chapter ...
AbstractVizing established an upper bound on the size of a graph of given order and radius. We find ...
AbstractA (d, D, D′, s)-digraph is a directed graph with diameter D and maximum out-degree d such th...
We study the (D;D) and (D;N) problems for double-step digraphs considering the unilateral distance, ...
SIGLETIB: RN 4052 (86419-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
The spectra of digraphs, unlike those of graphs, is a relatively unexplored territory. In a digraph,...
AbstractLet G=(V,E) be a digraph with diameter D≠1. For a given integer 1⩽t⩽D, the t-distance connec...
Rapport interne.In this paper, we focus on convergence packet routing techniques in a network, obtai...
Add to ORKG