Investigating the existence and the regularity of logarithmic Harary graphs

DOI10.1016/J.TCS.2009.01.041MaRDI QIDQ1019190zbMATH OpenOpenAlexFDO

Authors Roberto Baldoni, Silvia Bonomi, Leonardo Querzoni, Sara Tucci Piergiovanni

Publication date 28 May 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.01.041

zbMATH Keywords

flooding overlay networksgraph constraintslogarithmic Harary graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Optimal 1-Hamiltonian graphs
• Publication:4862353
• On the construction of most reliable networks
• Connectivity of random regular graphs generated by the pegging algorithm
• Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges

Cites work

• Active and Concurrent Topology Maintenance
• Araneola: a scalable reliable multicast system for dynamic environments
• Graph Transformations
• scientific article; zbMATH DE number 2079362 (Why is no real title available?)
• scientific article; zbMATH DE number 2080852 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• Parallel concepts in graph theory
• Viceroy, a scalable and dynamic emulation of the butterfly

Describes a project that uses

Uses Software

• Mathematica
• Pastry
• SCRIBE

This page was built for publication: Investigating the existence and the regularity of logarithmic Harary graphs

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