Digraphs with maximum number of paths and cycles

DOI10.1002/NET.3230170305zbMATH Open0645.90094OpenAlexW1992876379MaRDI QIDQ3789372FDOQ3789372

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

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

zbMATH Keywords

digraph3-diamond stringsFibonacci digraphsmaximum number of simple paths

Mathematics Subject Classification ID

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

Cites Work

• On Finding the Paths Through a Network

Cited In (14)

• On counting limited outdegree grid digraphs and greatest increase grid digraphs
• Largest digraphs contained in all n-tournaments
• Title not available (Why is that?)
• Digraphs containing every possible pair of dicycles
• Title not available (Why is that?)
• Algorithmic Solution of Extremal Digraph Problems
• Degree and local connectivity in digraphs
• The exact overall time distribution of a project with uncertain task durations
• Title not available (Why is that?)
• Maximum path digraphs
• Counting paths in digraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)