𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Edge Independence Number of a Regular Graph with Large Edge Connectivity

✍ Scribed by IZAK BROERE; GARY CHARTRAND; ORTRUND R. OELLERMANN; CURTISS E. WALL

Book ID
119862999
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
346 KB
Volume
555
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of connected sparsely edged g
The number of connected sparsely edged graphs. IV large nonseparable graphs
✍ E. M. Wright πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 306 KB

The number of nonseparable graphs on n labeled points and q lines is u(n, 9). In the second paper of this series an exact formula for u(n, n + k) was found for general n and successive (small) k. The method would give an asymptotic approximation for fixed k as n + 30. Here an asymptotic approximatio

Graphs with small numbers of independent
Graphs with small numbers of independent edges
✍ Miroslav M. PetroviΔ‡; Ivan Gutman; Mirko LepoviΔ‡ πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 327 KB

The graphs with exactly one, two or three independent edges are determined.

The independence number of an edge-chrom
The independence number of an edge-chromatic critical graph
✍ Douglas R. Woodall πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 77 KB πŸ‘ 1 views

A graph G with maximum degree and edge chromatic number (G)> is edge--critical if (G -e) = for every edge e of G. It is proved here that the vertex independence number of an edge--critical graph of order n is less than 3 5 n. For large , this improves on the best bound previously known, which was ro

The number of connected sparsely edged g
The number of connected sparsely edged graphs
✍ E. M. Wright πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^nβˆ’2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp