𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound for the complexity of a simple graph

✍ Scribed by Robert Grone; Russell Merris

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
310 KB
Volume
69
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a simple (nonfat graph wiih degree sequeme dl, dz, l . . , d,. The ~~~~~ of spanning trees of G is bounded above by

πŸ“œ SIMILAR VOLUMES

A lower bound for the circumference of a
A lower bound for the circumference of a graph
✍ Nathan Linial πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 423 KB

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

A probabilistic upper bound for the edge
A probabilistic upper bound for the edge identification complexity of graphs
✍ Eberhard Triesch πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 344 KB

Given a finite graph G=( V, E), what is the minimum number c(G) of incidence tests which are needed in the worst case to identify an unknown edge e\*EE? The number c(G) was first studied by Aigner and Triesch (1988), where it was shown that for almost all graphs in the random graph model where d(n)

An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≀ 1/2 __u__ + __g__ ‐ 1 ≀ __n__ ‐ 1, where __n__ is the total numbe