DSpace JSPUI
DSpace preserves and enables easy and open access to all types of digital content including text, images, moving images, mpegs and data sets
Learn More
Please use this identifier to cite or link to this item:
https://repository.unej.ac.id/xmlui/handle/123456789/58764| Title: | Open Problems in the Construction of Large Directed Graphs |
| Other Titles: | Masalah terbuka dalam konstruksi graf berarah besar |
| Authors: | Dafik, Mirka Miller, Joe Ryan, Slamin |
| Keywords: | Construction techniques, large order of directed graphs, degree, diameter. |
| Issue Date: | 15-Sep-2005 |
| Publisher: | Proceedings of the sixteenth Australasian Workshop on Combinatorial Algoritms |
| Citation: | The Construction of Large Directed Graphs |
| Series/Report no.: | AWOCA;16 |
| 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 specification, expansion and reduction methods. |
| Description: | This research topic is a part of extremal graph |
| URI: | http://repository.unej.ac.id/handle/123456789/58764 |
| ISBN: | 0-646-45252-5 |
| Appears in Collections: | MIPA |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| Open Problems in the Construction of Large Directed Graphs.pdf | 2.08 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.