Wide-diameter of product graphs

DOI10.3233/FI-2013-857MaRDI QIDQ2843821zbMATH OpenFDO

Authors Rija Erveš, Janez Žerovnik

Publication date 26 August 2013

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2013-857

zbMATH Keywords

Cartesian graph bundlefault diameterproduct graphRabin numberwide-diameter

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76) Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Wide diameters of Cartesian product graphs and digraphs
• scientific article; zbMATH DE number 5997381
• Wide diameter of Cartesian graph bundles
• Plenary Lecture 3: Fault diameters of graph products and bundles
• Edge fault-diameter of graph product

Cited in

(8)

• Generalized diameters and Rabin numbers of networks
• Wide diameters of Cartesian product graphs and digraphs
• Wide diameter for two families of interconnection networks
• Edge fault-diameter of graph product
• Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
• DIAMETER OF THE DIRECT PRODUCT OF WIELANDT GRAPH
• Rainbow domination regular graphs that are not vertex transitive
• Thinness of product graphs

This page was built for publication: Wide-diameter of product graphs

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