๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On paths avoiding forbidden pairs of vertices in a graph

โœ Scribed by Hananya Yinnone

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
473 KB
Volume
74
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the number of vertices of given degre
On the number of vertices of given degree in a random graph
โœ Zbigniew Palka ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 115 KB ๐Ÿ‘ 1 views

This note can be treated a s a supplement to a paper written by Bollobas which was devoted to the vertices of a given degree in a random graph. We determine some values of the edge probability p for which the number of vertices of a given degree of a random graph G E ?An, p) asymptotically has a nor

On numbers of vertices of maximum degree
On numbers of vertices of maximum degree in the spanning trees of a graph
โœ Jerzy Topp; Preben D. Vestergaard ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 611 KB

For a connected graph G, let ~-(G) be the set of all spanning trees of G and let nd(G) be the number of vertices of maximum degree in G. In this paper we show that if G is a cactus or a connected graph with p vertices and p+ 1 edges, then the set {na(T) : T C ~-(G)) has at most one gap, that is, it