𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The relationship of a regular splitting to a graph compatible splitting

✍ Scribed by Wen Li

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
230 KB
Volume
144
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Splitting Off Edges within a Specified S
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
✍ JΓΈrgen Bang-Jensen; Tibor JordΓ‘n πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 141 KB

Splitting off a pair su sv of edges in a graph G means the operation that deletes su and sv and adds a new edge uv. Given a graph G = V + s E which is kedge-connected (k β‰₯ 2) between vertices of V and a specified subset R βŠ† V , first we consider the problem of finding a longest possible sequence of

Splitting: Further contributions to the
Splitting: Further contributions to the development of a measure
✍ Dr. Marc B. Glassman πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 700 KB

This research (N = 130) attempts to cross-validate and, thereby, resolve several ambiguities in proposed splitting scale. It also argues for, and illustrates the use of, confirmatory rather than exploratory factor analytic techniques in evaluating the internal construct validity of newly proposed,

The matching polynomial of a regular gra
The matching polynomial of a regular graph
✍ Robert A. Beezer; E.J. Farrell πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i