A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the vertices in G. An isolated vertex is a groupie only if all vertices of G are isolated. While it is well known that every graph must contai
A lower bound for area-universal graphs
โ Scribed by Gianfranco Bilardi; Shiva Chaudhuri; Devdatt Dubhashi; K. Mehlhorn
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 525 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Lrzt G = (V, 0 be a ttlock :.>f order n, different from Kn. Let ~FI = min {d(x) + d(y): n then G contains a cycle of length at least m. 1. Introductlion and notatio e discuss only finite undirected graphs withsLc loops and multiple edges. We p:rosye the main theorem d show how Qre's th -orem [ 3.1 o
We study the connections between dynamical properties of Schro dinger operators H on separable Hilbert space H and the properties of corresponding spectral measures. Our main result establishes a relation for the moment of order p of the form H dt L , pรd (T ). (1) Here L , pรd (T ) is a function