๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A matrix method for location of cycles of a directed graph

โœ Scribed by R. L. Norman

Publisher
American Institute of Chemical Engineers
Year
1965
Tongue
English
Weight
269 KB
Volume
11
Category
Article
ISSN
0001-1541

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the cycle polytope of a directed grap
On the cycle polytope of a directed graph
โœ Egon Balas; Maarten Oosten ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB ๐Ÿ‘ 1 views
Proof of a conjecture on cycles in a bip
Proof of a conjecture on cycles in a bipartite graph
โœ Wang, Hong ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 244 KB ๐Ÿ‘ 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k โ‰ฅ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n โ‰ฅ 3k, i.e., M (k) โ‰ค 3k. W

On the spectral radius of a directed gra
On the spectral radius of a directed graph
โœ Kwapisz, Jaroslaw ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 314 KB ๐Ÿ‘ 1 views

We provide upper estimates on the spectral radius of a directed graph. In particular w e prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.

Graphs omitting a finite set of cycles
Graphs omitting a finite set of cycles
โœ Cherlin, Gregory; Shi, Niandong ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 300 KB ๐Ÿ‘ 2 views

We prove that for C a finite set of cycles, there is a universal C-free graph if and only if C consists precisely of all the odd cycles of order less than same specified bound.

A deghosting method for locating communi
A deghosting method for locating communicating transmitters using asynchronous direction finders
โœ Hisakazu Maniwa; Masafumi Iwamoto; Yoshio Kosuge; Masaaki Kobayashi ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 267 KB

When several unknown communication sources are to be located, ghosts appear. These ghosts must be eliminated. Since the conventional deghosting methods compare the characteristics of the received signals, the direction finders need to measure the same frequency ranges at the same time. However, when