Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on metho...
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinso...
Abstract--Following the discovery of a fundamental connection between information measures and estimation measures in Gaussian channels, this paper explores the counterpart of thos...
Interference from other users limits the capacity, and possibly the connectivity, of wireless networks. A simple model of a wireless ad-hoc network, in which node locations are des...
Any technology requires some number of key design decisions. In the case of the ATM user plane, the choices to use fixed length, 53 byte cells and virtual connections were unortho...
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...
Brian A. Davey, Pawel M. Idziak, William A. Lampe,...