Paper Info
Title
Asymptotic behaviour of the observability of Qn
Abstract
Observability of a graph G is the minimum k for which the edges of G can be properly coloured with k colours in such a way that colour sets of vertices of G (sets of colours of their incident edges) are pairwise distinct. It is shown that lim n→∞ obs (Q n ) n = 1 + q ∗ where q ∗ = 0.293815 … is the unique solution of the equation ( x + 1) x +1 = 2 x x in the interval (0, ∞).
Year
DOI
Venue
1997
10.1016/S0012-365X(96)00292-0
Discrete Mathematics
Keywords
DocType
Volume
Asymptotic behaviour
Journal
176
Issue
ISSN
Citations 
1-3
Discrete Mathematics
7
PageRank 
References 
Authors
1.86
0
2
Name
Order
Citations
PageRank
Mirko Horňák112716.28
Roman Soták212824.06