𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On independent circuits of a digraph

✍ Scribed by S. Rao Kosaraju

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
156 KB
Volume
1
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

If every three circuits of a digraph have a common vertex, then all the circuits have one.

πŸ“œ SIMILAR VOLUMES

Circuits in cayley digraphs of finite ab
Circuits in cayley digraphs of finite abelian groups
✍ Anne Marie Wilkinson πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 290 KB

## Abstract We find all possible lengths of circuits in Cayley digraphs of two‐generated abelian groups over the two‐element generating sets and over certain three‐element generating sets.

A frequency-independent circuit model of
A frequency-independent circuit model of a conductor under surge conditions
✍ A. E. Davies; Y. K. Tong; P. L. Lewin; D. M. German πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 402 KB

## Abstract This paper presents a circuit‐based model of a current carrying conductor that can provide instantaneous ohmic losses under surge conditions. The model is frequency independent and can be used to calculate transient current characteristics of surges on overhead transmission lines. The t

On the Capacity of Digraphs
On the Capacity of Digraphs
✍ Noga Alon πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 76 KB

For a digraph G = (V, E) let w(G n ) denote the maximum possible cardinality of a subset S of V n in which for every ordered pair It is also shown that for every n there is a tournament T on 2n vertices whose capacity is at least √ n, whereas the maximum number of vertices in a transitive subtourna

The circular chromatic number of a digra
The circular chromatic number of a digraph
✍ Drago Bokal; GasΜ†per Fijavz; Martin Juvan; P. Mark Kayll; Bojan Mohar πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 1 views

## Abstract We introduce the circular chromatic number Ο‡~__c__~ of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directe