Jou-Ming Chang

activity

20172025

most citedThe 4-Component Connectivity of Alternating Group Networks

48 citations · 112 across the 9 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2025

Neighbor Connectivity of Undirected Toroidal Meshes

Hui-Ming Huang, Ruichao Niu, Min Xu +1

In this paper, we examine the neighbor connectivity, denoted as $κ_{N B}$ , of the undirected toroidal mesh $C (d_{1}, d_{2}, \dots, d_{n})$ . We demonstrate that $κ_{NB}(C(d_1,d_2,\ldots,d_n)…

math.CO2025

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 $m$ -disjoint…

math.CO2024

Packing internally disjoint Steiner paths of data center networks

Wen-Han Zhu, Rong-Xia Hao, Jou-Ming Chang +1

Let $S \subseteq V (G)$ and $π_{G} (S)$ denote the maximum number $t$ of edge-disjoint paths $P_{1}, P_{2}, \dots, P_{t}$ in a graph $G$ such that $V (P_{i}) \cap V (P_{j}) = S$ for any $i,j…

math.CO2021★ 1 cited

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…

math.CO2019★ 1 cited

Strong Menger connectedness of augmented $k$ -ary $n$ -cubes

Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao

A connected graph $G$ is called strongly Menger (edge) connected if for any two distinct vertices $x, y$ of $G$ , there are $min {deg_{G} (x), deg_{G} (y)}$ vertex(edge)-dis…

math.CO2017

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.