Premium
On the unilateral (Δ, D *)‐problem
Author(s) -
Gómez José,
Canale Eduardo A.,
Muñoz Xavier
Publication year - 2000
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/1097-0037(200010)36:3<164::aid-net3>3.0.co;2-n
Subject(s) - digraph , vertex (graph theory) , combinatorics , mathematics , degree (music) , join (topology) , table (database) , computer science , discrete mathematics , graph , data mining , physics , acoustics
Large digraphs of a specified maximum degree and unilateral diameter are given for small values of these parameters. The constructions are based on different techniques such as voltage digraphs, digraph products, join of cycles, and vertex duplication. Finally, a table with the results is given. © 2000 John Wiley & Sons, Inc.