gaussian networks
Recently Published Documents


TOTAL DOCUMENTS

90
(FIVE YEARS 0)

H-INDEX

19
(FIVE YEARS 0)

2020 ◽  
Vol 7 (1) ◽  
pp. 446-457
Author(s):  
Curtis McDonald ◽  
Fady Alajaji ◽  
Serdar Yuksel

Author(s):  
Qilong Wang ◽  
Peihua Li ◽  
Qinghua Hu ◽  
Pengfei Zhu ◽  
Wangmeng Zuo
Keyword(s):  

2017 ◽  
Vol 109 ◽  
pp. 324-332 ◽  
Author(s):  
Zaid Hussain ◽  
Bader AlBdaiwi ◽  
Anton Cerny

2017 ◽  
Vol 17 (03n04) ◽  
pp. 1741008
Author(s):  
MUHAMMAD ADIB SURANI

The w-wide diameter of a graph is a generalisation of its diameter and connectivity, and is useful for measuring the reliability of an interconnection network. The Gaussian networks, which are defined via quotient rings of the Gaussian integers, have been shown to satisfy many good properties of an interconnection network. In this paper, we will establish the wide diameters of the Gaussian networks and show that they are at most three more than the diameter.


Sign in / Sign up

Export Citation Format

Share Document