1 citations · 1 across the 7 of their papers we have counts for
7 papers
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…
The vulnerability of the diameter of enhanced hypercubes
Meijie Ma, Douglas B. West, Jun-Ming Xu
For an interconnection network , the {\it -wide diameter} is the least such that any two vertices are joined by internally-disjoint paths of length at mos…
Cycles in enhanced hypercubes
Meijie Ma
The enhanced hypercube is a variant of the hypercube . We investigate all the lengths of cycles that an edge of the enhanced hypercube lies on. It is proved that eve…
Topological properties on the diameters of the integer simplex
Meijie Ma
Wide diameter and fault-diameter of an interconnection network have been recently studied by many authors. We determine the wide diameter and fault-diameter o…
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…