We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...
Arnold Knopfmacher, Robert F. Tichy, Stephan Wagne...
The problem of counting plane trees with n edges and an even or an odd number of leaves has been recently studied by Eu, Liu and Yeh, in connection with an identity on coloring ne...
William Y. C. Chen, Louis W. Shapiro, Laura L. M. ...
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...