We present a short way of proving the inequalities obtained by Wright in [Journal of Graph Theory, 4: 393 – 407 (1980)] concerning the number of connected graphs with ℓ edges m...
In this paper, subgraphs and complementary graphs are used to analyze network synchronizability. Some sharp and attainable bounds are derived for the eigenratio of the network str...
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...
Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We als...
Graphs are a versatile representation of many systems in computer science, the social sciences, and mathematics, but graph theory is not taught in schools. We present our work on ...
Eric Schweikardt, Nwanua Elumeze, Michael Eisenber...