𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A matrix method for finding the ranks and regularly numbering the vertices of a flow graph

✍ Scribed by F.F. Atstopas; K.I. Plukas

Publisher
Elsevier Science
Year
1970
Weight
293 KB
Volume
10
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Real flow number and the cycle rank of a
Real flow number and the cycle rank of a graph
✍ Robert Lukot'ka; Martin Ε koviera πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 101 KB

## Abstract This article establishes a relationship between the real (circular) flow number of a graph and its cycle rank. We show that a connected graph with real flow number __p__/__q__ + 1, where __p__ and __q__ are two relatively prime numbers must have cycle rank at least __p__ + __q__β€‰βˆ’β€‰1. A

Chromatic Number and the 2-Rank of a Gra
Chromatic Number and the 2-Rank of a Graph
✍ C.D. Godsil; Gordon F. Royle πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 98 KB

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2 r +1, and that this bound is tight. 2001