𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting irregular multigraphs

✍ Scribed by Aron C. Atkins; Gabor N. Sarkozy; Stanley M. Selkow


Book ID
108316290
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
112 KB
Volume
195
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Counting spanning trees in directed regu
✍ Jacek M. Wojciechowski; Michael Fellows πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 484 KB

The problem of counting spunning trees in regular multigraphs is considered. The emphasis is on the case of directed trees. It is shown that the numbers qf spanning intrees and out-trees with respect to any point of' a regular multigraph are the same. A general .formulafor counting directed spunning

Irregular embeddings of multigraphs with
✍ Michael S. Jacobson; JenΓΆ Lehel πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 254 KB

Let G be a c-chromatic multigraph (c >t 2) with maximum edge multiplicity s. In this note we show that G has an embedding as an induced subgraph, into some degree irregular c-chromatic multigraph having the same maximum edge multiplicity.

Parsimonious Multigraphs
✍ Will, Todd G.; Hulett, Heather πŸ“‚ Article πŸ“… 2004 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 98 KB