3 papers
math.CO2018
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}'…
math.CO2016
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…
cs.DM2016
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…