On (4,2)-digraph Containing a Cycle of Length 2
| Main Authors: | Iswadi, Hazrul, Baskoro, Edy Tri |
|---|---|
| Format: | Article PeerReviewed application/pdf |
| Terbitan: |
Malaysian Mathematical Society
, 2000
|
| Subjects: | |
| Online Access: |
http://repository.ubaya.ac.id/265/1/hazrul_On%20(4%2C2)%2Ddigraph%20Containing%20a%20Cycle%20of%20Length%202_2000.pdf http://repository.ubaya.ac.id/265/ |
Daftar Isi:
- A diregular digraph is a digraph with the in-degree and out-degree of all vertices is constant. The Moore bound for a diregular digraph of degree d and diameter k is M_{d,k}=l+d+d^2+...+d^k. It is well known that diregular digraphs of order M_{d,k}, degree d>l tnd diameter k>l do not exist . A (d,k) -digraph is a diregular digraph of degree d>1, diameter k>1, and number of vertices one less than the Moore bound. For degrees d=2 and 3,it has been shown that for diameter k >= 3 there are no such (d,k)-digraphs. However for diameter 2, it is known that (d,2)-digraphs do exist for any degree d. The line digraph of K_{d+1} is one example of such (42)-digraphs. Furthermore, the recent study showed that there are three non-isomorphic(2,2)-digraphs and exactly one non-isomorphic (3,2)-digraph. In this paper, we shall study (4,2)-digraphs. We show that if (4,2)-digraph G contains a cycle of length 2 then G must be the line digraph of a complete digraph K_5.