On the ultimate categorical independence ratio


Brown, Nowakowski and Rall defined the ultimate categorical independence ratio of a graph G as A(G) = lim k→∞ i(G×k), where i(G) = α(G) |V (G)| denotes the independence ratio of a graphG, andG ×k is the kth categorical power of G. Let a(G) = max{ |U | |U |+|NG(U)| : U is an independent set of G}, where NG(U) is the neighborhood of U in G. In this paper we… (More)
DOI: 10.1016/j.jctb.2014.02.010


3 Figures and Tables


Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.