✦ LIBER ✦

Counting strong digraphs

✍ Scribed by Robert W. Robinson

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 94 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010215

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting small cycles in generalized de

Counting small cycles in generalized de Bruijn digraphs

✍ Hasunuma, Toru; Shibata, Yukio 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

In this paper, we count small cycles in generalized de Bruijn digraphs. Let n Å pd h , where d É / p, and g l Å gcd(d l 0 1, n). We show that if p õ d 3 and k °log d n / 1, or p ú d 3 and k °h / 3, then the number of cycles of length k in a generalized de Bruijn digraph G B (n, d) is given by 1/ k

A Matrix for Counting Paths in Acyclic D

A Matrix for Counting Paths in Acyclic Digraphs

✍ Richard P. Stanley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 178 KB

We define a matrix A associated with an acyclic digraph 1, such that the coefficient of z j in det(I+zA) is the number of j-vertex paths in 1. This result is actually a special case of a more general weighted version.

The Minimum Spanning Strong Subdigraph P

The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs

✍ Jørgen Bang-Jensen; Anders Yeo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 148 KB

We consider the problem (minimum spanning strong subdigraph (MSSS)) of finding the minimum number of arcs in a spanning strongly connected subdigraph of a strongly connected digraph. This problem is NP-hard for general digraphs since it generalizes the Hamiltonian cycle problem. We characterize the

Hypotraceable digraphs

✍ Martin Grötschel; Carsten Thomassen; Yoshiko Wakabayashi 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract A hypotraceable digraph is a digraph __D__ = (__V, E__) which is not traceable, i.e., does not contain a (directed)Hamiltonian path, but for which __D__ ‐ __v__ is traceable for all __ve__ ∈ __V__. We prove that a hypotraceable digraph of order __n__ exists iff __n__ ≥ 7 and that for ea

Covering a Strong Digraph by α−1 Disjoin

Covering a Strong Digraph by α−1 Disjoint Paths: A Proof of Las Vergnas' Conjecture

✍ Stéphan Thomassé 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 83 KB

The Gallai Milgram theorem states that every directed graph D is spanned by :(D) disjoint directed paths, where :(D) is the size of a largest stable set of D. When :(D)>1 and D is strongly connected, it has been conjectured by Las Vergnas that D is spanned by an arborescence with :(D)&1 leaves. The

On counting and counting errors

✍ R.W. Guillery 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract Counting objects in histological sections is often a necessary, sometimes an unexpected part of a research project. The recent literature shows that the subject of counting is of particular interest to readers of the __Journal of Comparative Neurology__ but that it is also contentious a