KETUNGGALAN GRAF BERARAH BERORDE MAKSIMUM
</b>Abstract:<p align=\"justify\"> <br /> It is well known that Moore digraphs of degree d > 1 and diameter k > 1 do not exist. For degree 2 and 3, it has been shown that for diameter k > 3 there are no almost Moore digraphs, i.e. the diregular digraphs of orde...
Saved in:
Main Author: | Mery Garnierita Simanjuntak, Rinovia |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/4716 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
ALGORITMA DAN PROGRAM MATCHING MAKSIMUM PADA GRAF TRIPARTIT
by: ANDIK YULIANTO, 089912030
Published: (2004) -
BANYAKNYA MODEL MATCHING MAKSIMUM
PADA GRAF TRIPARTIT LENGKAP
by: RETNO AGENG H., 089911980
Published: (2003) -
KETUNGGALAN DIGRAF-(4,2)
by: ATIK WIJAYANTI, 089912051
Published: (2003) -
RUANG BARISAN CESARO BERORDER P
by: , Wahyu Indarwati, SP.d, et al.
Published: (2012) -
OPTIMISASI DENGAN METODE PENCARIAN LANGSUNG BERARAH
by: , KIRTYANA NINDITA, et al.
Published: (2014)