The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...