48 citations · 112 across the 9 of their papers we have counts for
9 papers
Neighbor Connectivity of Undirected Toroidal Meshes
Hui-Ming Huang, Ruichao Niu, Min Xu +1
In this paper, we examine the neighbor connectivity, denoted as , of the undirected toroidal mesh . We demonstrate that $κ_{NB}(C(d_1,d_2,\ldots,d_n)…
Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
Wenjing Zhang, Qingqiong Cai, Jou-Ming Chang
BCube, as a popular server-centric data center network (DCN), offers significant advantages in low latency, load balancing, and high bandwidth. The many-to-many paired -disjoint…
Packing internally disjoint Steiner paths of data center networks
Wen-Han Zhu, Rong-Xia Hao, Jou-Ming Chang +1
Let and denote the maximum number of edge-disjoint paths in a graph such that for any $i,j…
Transmission Failure Analysis of Multi-Protection Routing in Data Center Networks with Heterogeneous Edge-Core Servers
Xiao-Yan Li, Wanling Lin, Jou-Ming Chang +1
The recently proposed RCube network is a cube-based server-centric data center network (DCN), including two types of heterogeneous servers, called core and edge servers. Remarkably…
On the Decycling Number of Bubble-sort Star Graphs
Yu-Zhe Liu, Shyue-Ming Tang, Jou-Ming Chang
Bubble-sort star graphs are a combination of star graphs and bubble sort graphs. They are bipartite graphs and also form a family of Cayley graphs. The decycling number of a graph…
Strong Menger connectedness of augmented -ary -cubes
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
A connected graph is called strongly Menger (edge) connected if for any two distinct vertices of , there are vertex(edge)-dis…
The Component Connectivity of Alternating Group Graphs and Split-Stars
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
For an integer , the -component connectivity of a graph , denoted by , is the minimum number of vertices whose removal from results in a…
The 4-Component Connectivity of Alternating Group Networks
Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu +1
The -component connectivity (or -connectivity for short) of a graph , denoted by , is the minimum number of vertices whose removal from results in a d…
Gray Codes for AT-Free Orders
Jou-Ming Chang, Ton Kloks, Hung-Lung Wang
AT-free graphs are characterized by vertex elimination orders. We show that these AT-free orders of a graph can be generated in constant amortized time.