Sciweavers

684 search results - page 34 / 137
» A characterization of b-perfect graphs
Sort
View
SIAMDM
1998
95views more  SIAMDM 1998»
15 years 1 months ago
The Graphs with All Subgraphs T-Perfect
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...
A. M. H. Gerards, F. Bruce Shepherd
DM
2011
223views Education» more  DM 2011»
14 years 8 months ago
On graph equivalences preserved under extensions
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...
Zbigniew Lonc, Miroslaw Truszczynski
ICPR
2008
IEEE
15 years 8 months ago
Birkhoff polytopes, heat kernels and graph complexity
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...
WAW
2004
Springer
80views Algorithms» more  WAW 2004»
15 years 7 months ago
Dominating Sets in Web Graphs
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...
Colin Cooper, Ralf Klasing, Michele Zito
EJC
2010
15 years 1 months ago
Geometric properties of Assur graphs
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...
Brigitte Servatius, Offer Shai, Walter Whiteley