Digraphs with maximum number of paths and cycles

Document Type

Article

Publication Date

1-1-1987

Abstract

We construct a digraph with the maximum number of simple paths between two specified vertices, for a digraph with a given number of edges. The following cases are considered: digraphs with parallel edges, acyclic simple digraphs and general simple digraphs. The corresponding extremal digraphs are the tri‐chains, the (deficient) Fibonacci digraphs and (if our conjecture is true) the 3‐diamond strings, respectively. The similarity of these three families of digraphs is discussed. The related problem of digraphs with the maximum number of simple cycles for a given number of edges is considered too. Copyright © 1987 Wiley Periodicals, Inc., A Wiley Company

Identifier

84986992426 (Scopus)

Publication Title

Networks

External Full Text Location

https://doi.org/10.1002/net.3230170305

e-ISSN

10970037

ISSN

00283045

First Page

295

Last Page

305

Issue

3

Volume

17

This document is currently not available here.

Share

COinS