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

A note on the spectral characterization of strongly connected bicyclic digraphs

โœ Scribed by Huiqiu Lin; Jinlong Shu

Book ID
113772125
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
281 KB
Volume
436
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on top down and bottom up analysi
A note on top down and bottom up analysis of strongly connected digraphs
โœ G. Chaty; M. Chein ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB

Knuth proposed to compare his method and those of Luce for studying strongly connected digraphs. Changing Knuth's notation slightly we construct a set of strongly connected digraphs which is equal to the set of the compound circuits defined by Luce. (Let us recall that Luce proved that a minimal str

On complete strongly connected digraphs
On complete strongly connected digraphs with the least number of 3-cycles
โœ M. Burzio; J. Pelant ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 186 KB

The least number of 3-cycles (cycles of length 3) that a hamiltonian tournament of order n can contain is n -2 (see [3]). Since each complete strongly connected digraph contains a spanning hamiltonian subtournament (see [2]), n-2 is also the least number of 3-cycles for these digraphs. In this pape