id: 04057566
dt: j
an: 04057566
au: Wang, Zhijian
ti: On amida number of regular graphs of odd orders.
so: J. Xinjiang Univ., Nat. Sci. 4, No.1, 11-14 (1987).
py: 1987
pu: Publishing House of Xinjiang University, Urumqi
la: ZH
cc: 
ut: amida paths; amida number; regular graphs
ci: Zbl 0563.05037
li: 
ab: {\it L. Orton} and {\it R. Ringeisen} [Combinatorics, graph theory and
    computing, Proc. 15 Southeast. Conf., La. State Univ. 1984, Congr.
    Numerantium 44, 315-320 (1984; Zbl 0563.05037)] have indicated that the
    amida number of regular graphs of degree r and odd order is at most r.
    In this paper it is shown that this conclusion is not true. In fact,
    for any odd n and even r, where $4\le r\le n-3$, we can always
    construct a regular graph of degree r and order n, whose amida number
    is greater than r.
rv: