𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spectra of digraphs

✍ Scribed by Richard A. Brualdi

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
475 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The spectra of wrapped butterfly digraph
The spectra of wrapped butterfly digraphs
✍ Francesc Comellas; Miquel Angel Fiol; Joan Gimbert; Margarida Mitjana πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 96 KB

## Abstract The knowledge of the spectrum of a (di)graph is relevant for estimating some of its structural properties, which provide information on the topological and communication properties of the corresponding networks. Among these properties, we have, for instance, edge‐expansion and node‐expa

A line digraph of a complete bipartite d
A line digraph of a complete bipartite digraph
✍ Juan Liu; Lin Sun; Jixiang Meng πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 310 KB

In the context of the degree/diameter problem for directed graphs, it is known that the number of vertices of a strongly connected bipartite digraph satisfies a Moore-like bound in terms of its diameter k and the maximum outdegrees (d 1 , d 2 ) of its partite sets of vertices. In this work, we defi

Hypotraceable digraphs
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