Construction Techniques for Digraphs with Minimum Diameter

DOI10.1007/978-3-642-45278-9_28MaRDI QIDQ2870038zbMATH OpenOpenAlexFDO

Authors Mirka Miller, E. T. Baskoro, Joe Ryan, Slamin

Publication date 17 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_28

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 890664
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
• On the construction of regular minimal broadcast digraphs
• Approximation algorithms for constructing some required structures in digraphs
• scientific article; zbMATH DE number 4014755
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II
• scientific article; zbMATH DE number 3849274
• Construction of extremal mixed graphs of diameter two
• Size of graphs and digraphs with given diameter and connectivity constraints

Cited in

(7)

• scientific article; zbMATH DE number 1696635 (Why is no real title available?)
• scientific article; zbMATH DE number 5994744 (Why is no real title available?)
• The diameter of cyclic Kautz digraphs
• New cyclic Kautz digraphs with optimal diameter
• scientific article; zbMATH DE number 890664 (Why is no real title available?)
• Some inner metric parameters of a digraph: iterated line digraphs and integer sequences
• HSAGA and its application for the construction of near-Moore digraphs

This page was built for publication: Construction Techniques for Digraphs with Minimum Diameter

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