Computer scientists are constantly searching for ways to squeeze ever more bandwidth from communications networks. Now a new approach to understanding a basic concept in graph theory, known as "vertex ...

We consider the number of vertex independent sets i(G). In general, the problem of determining the value of i(G) is NP-complete. We present several upper and lower bounds for i(G) in terms of order, ...

This is a preview. Log in through your library . Abstract In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a ...