Hits:

Indexed by:期刊论文

Date of Publication:2012-01-01

Journal:Australasian Journal of Combinatorics

Included Journals:Scopus

Volume:52

Page Number:3-9

ISSN No.:10344942

Abstract:The feedback number f(d, n) of the Kautz undirected graph UK(d, n) is the minimum number of vertices whose removal results in an acyclic graph. This paper shows [(d n+1 - d n-1 - 1/2d(d + 1) + 1)/(2d - 1)]    f(d, n)    d n - ([d 2/4] + 1)d n-2, which implies that f(2, n) = 2 n-1, as obtained by Kr  lovi? and Ru?i?ka [Information Processing Letters 86 (4) (2003), 191-196].