Maximally and super connected multisplit graphs and digraphs

Applicable Analysis and Discrete Mathematics

article

Litao Guo¹  Guifu Su²  Lutz Volkmann³  Xingke Zhao⁴ 

[1] School of Applied Mathematics, Xiamen University of Technology;School of Science, Beijing University of Chemical Technology;Lehrstuhl II f¨ur Mathematik, RWTH Aachen University;Editorial Department of Journal of Xinjiang University

关键词: the zeroth-order general Randi'{c} inde;    super-edge-connected;    Split graphs;    Maximally edge-connected;    digraphs;   

DOI  :  10.2298/AADM170716024G

学科分类：社会科学、人文和艺术（综合）

来源: Univerzitet u Beogradu * Elektrotehnicki Fakultet / University of Belgrade, Faculty of Electrical Engineering

【 摘 要 】

Interconnection networks is an important research area for parallel and distributed computer systems. Network reliability is one of the most significant factors in designing the topology of an interconnection network. Fault tolerance is an important property of network performance. A classic measure of the fault toleranceof a network is the connectivity and edge-connectivity of the corresponding graph.In general, the larger connectivity/edge-connectivity is, the more reliable the network is.

【 授权许可】

Unknown