1 citations · 1 across the 7 of their papers we have counts for
4 papers · 1 filter
List strong edge-coloring of graphs with maximum degree 4
Baochen Zhang, Yulin Chang, Jie Hu +2
A strong edge-coloring of a graph is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $χ_{s}'…
Degree-associated edge-reconstruction numbers of double-brooms
Meijie Ma, Tingting Zhou
An edge-deleted subgraph of a graph is an {\it edge-card}. A {\it decard} consists of an edge-card and the degree of the missing edge. The {\it degree-associated edge-reconstru…
Many-to-many disjoint paths in hypercubes with faulty vertices
Xiang-Jun Li, Bin Liu, Meijie Ma +1
This paper considers the problem of many-to-many disjoint paths in the hypercube with faulty vertices and obtains the following result. For any integer with $1\leq k\…
Fault-tolerant analysis of augmented cubes
Meijie Ma, Yaxing Song, Jun-Ming Xu
The augmented cube , proposed by Choudum and Sunitha [S. A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71-84], is a -regular -connected grap…