Jumat, 07 Maret 2014 - 19:53:30 WIB
Open Problems in the Construction of Large Directed Graphs
Dafik, M. Miller, J. Ryan, Slamin; Proceedings of the sixteenth Australasian Workshop on Combinatorial Algoritms, 16 (2005) 95 - 104
Proseeding

Abstract

Abstract: In this paper we consider the problem of how to construct directed graphs with given maximum out-degree and diameter. To deal with this problem, we describe several construction techniques. These fall into three broad categories, namely, algebraic speci¯cation, expansion and reduction methods.

Key Words: Construction techniques, large order of directed graphs, degree, diameter.


.:: Welcome to Prof. Dafik M.Sc,Ph.D Academic Website ::.