Digraphs with maximum number of paths and cycles

DOI10.1002/NET.3230170305MaRDI QIDQ3789372zbMATH OpenOpenAlexFDO

Authors Yehoshua Perl

Publication date 1987

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230170305

zbMATH Keywords

3-diamond stringsdigraphFibonacci digraphsmaximum number of simple paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Maximum path digraphs
• scientific article; zbMATH DE number 3877220
• Degree and local connectivity in digraphs
• On the number of cycles possible in digraphs with large girth
• scientific article; zbMATH DE number 3952804

Cites work

• On Finding the Paths Through a Network

Cited in

(14)

• Degree and local connectivity in digraphs
• Maximum path digraphs
• On counting limited outdegree grid digraphs and greatest increase grid digraphs
• scientific article; zbMATH DE number 4134077 (Why is no real title available?)
• scientific article; zbMATH DE number 3851134 (Why is no real title available?)
• scientific article; zbMATH DE number 3877220 (Why is no real title available?)
• scientific article; zbMATH DE number 3908459 (Why is no real title available?)
• Algorithmic Solution of Extremal Digraph Problems
• scientific article; zbMATH DE number 3991532 (Why is no real title available?)
• scientific article; zbMATH DE number 4027500 (Why is no real title available?)
• Digraphs containing every possible pair of dicycles
• The exact overall time distribution of a project with uncertain task durations
• Largest digraphs contained in all n-tournaments
• Counting paths in digraphs

This page was built for publication: Digraphs with maximum number of paths and cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789372)