𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degrees of Souslin And Aronszajn Trees

✍ Scribed by Ingrid Lindström

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
739 KB
Volume
33
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degrees of Souslin Trees
Degrees of Souslin Trees
✍ Stefan Bilaniuk 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB
Average distance, minimum degree, and sp
Average distance, minimum degree, and spanning trees
✍ Dankelmann, Peter; Entringer, Roger 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 218 KB

The average distance µ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., µ(G) = ( n 2 ) -1 {x,y}⊂V (G) d G (x, y), where V (G) denotes the vertex set of G and d G (x, y) is the distance between x and y. We prove that every connected graph

NP-completeness and degree restricted sp
NP-completeness and degree restricted spanning trees
✍ Robert James Douglas 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 449 KB

In this paper several results are proved: (1) Deciding whether a given planar graph G with maximum degree 3 has a spanning tree T, where deg(x, T) = 1 or 3 for each node x, is NP-Complete. (2) For each proper subset S of the positive integers Z+ with 1 E S and (S( 2 2, deciding whether a planar gra