Properties of a class of trivalent network graphs and optimal routing

DOI10.1016/0898-1221(91)90040-BzbMath0793.68110OpenAlexW2017400219MaRDI QIDQ1179383

Bhabani P. Sinha, Pradip K. Srimani, Bhargab Bikram Bhattacharya, Suranjan Ghose

Publication date: 26 June 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90040-b

zbMATH Keywords

network graphsMoebius graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

Cites Work

• Unnamed Item
• Dense Trivalent Graphs for Processor Interconnection
• Search Algorithms Under Different Kinds of Heuristics—A Comparative Study

This page was built for publication: Properties of a class of trivalent network graphs and optimal routing