activity
20052019
most citedAn algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)

1 citations · 2 across the 11 of their papers we have counts for

collaborators

11 papers

math.CO2019

Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks THLNs

Huifeng Zhang, Xirong Xu, Jing Guo +1

The twisted hypercube-like networks() contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of -dimensional(-…

math.CO2017

Decycling Number of Linear Graphs of Trees

Jian Wang, Xirong Xu

The decycling number of a graph is the minimum number of vertices whose removal from results in an acyclic subgraph. It is known that determining the decycling number of a…

cs.DM2012

The crossing number of pancake graph is six

Yuansheng Yang, Bo Lv, Baigong Zheng +2

The {\it crossing number} of a graph is the least number of pairwise crossings of edges among all the drawings of in the plane. The pancake graph is an important topology f…

cs.DM2012

The crossing numbers of and

Yuansheng Yang, Baigong Zheng, Xirong Xu +1

The {\it crossing number} of a graph is the minimum number of pairwise intersections of edges in a drawing of . In this paper, we study the crossing numbers of $K_{m}\times…

cs.DM2012

The crossing number of the generalized Petersen graph P(10, 3) is six

Yuansheng Yang, Baigong Zheng, Xirong Xu

The crossing number of a graph is the least number of crossings of edges among all drawings of the graph in the plane. In this article, we prove that the crossing number of the gen…

cs.DM2012

The crossing numbers of , , and

Yuansheng Yang, Baigong Zheng, Xiaohui Lin +1

The crossing number of a graph is the minimum number of pairwise intersections of edges among all drawings of . In this paper, we study the crossing number of …