𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph decompositions for demographic loop analysis

✍ Scribed by Michael J. Adams

Book ID
105998598
Publisher
Springer
Year
2007
Tongue
English
Weight
190 KB
Volume
57
Category
Article
ISSN
0303-6812

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An existence theory for loopy graph deco
An existence theory for loopy graph decompositions
✍ Peter Dukes; Amanda Malloch πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

Let v β‰₯ k β‰₯ 1 and k β‰₯ 0 be integers. Recall that a (v, k, k) block design is a collection B of k-subsets of a v-set X in which every unordered pair of elements in X is contained in exactly k of the subsets in B. Now let G be a graph with no multiple edges. A (v, G, k) graph design is a collection H

Revisiting decomposition analysis of geo
Revisiting decomposition analysis of geometric constraint graphs
✍ R. Joan-Arinyo; A. Soto-Riera; S. Vila-Marta; J. Vilaplana-PastΓ³ πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 651 KB

Geometric problems defined by constraints can be represented by geometric constraint graphs whose nodes are geometric elements and whose arcs represent geometric constraints. Reduction and decomposition are techniques commonly used to analyze geometric constraint graphs in geometric constraint solvi

Fixed-edge theorem for graphs with loops
Fixed-edge theorem for graphs with loops
✍ Richard Nowakowski; Ivan Rival πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 521 KB

## Abstract Let __G__ be an undirected graph without multiple edges and with a loop at every vertexβ€”the set of edges of __G__ corresponds to a reflexive and symmetric binary relation on its set of vertices. Then __every edge‐preserving map of the set of vertices of G to itself fixes an edge__ [{__f

A decomposition for strongly perfect gra
A decomposition for strongly perfect graphs
✍ Stephan Olariu πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 554 KB

A graph G is strongly perfect if every induced subgraph H of G contains a stable set that meets all the maximal cliques of H . We present a graph decomposition that preserves strong perfection: more precisely, a stitch decomposition of a graph G = (V, €1 is a partition of V into nonempty disjoint su