most citedThe 2-Domination and 2-Bondage Numbers of Grid Graphs

5 citations · 13 across the 14 of their papers we have counts for

collaborators
Showing math.COShow all

14 papers · 1 filter

math.CO2012

The p-Domination Number of Complete Multipartite Graphs

You Lu, Jun-Ming Xu

Let be a graph and a positive integer. A subset is called a -dominating set of if every vertex not in has at least neighbors in . The…

math.CO2012

On the minimal feedback arc set of m-free Digraphs

Hao Liang, Jun-Ming Xu

For a simple digraph , let be the size of the smallest subset such that has no directed cycles, and let be the number of unordered pairs of…

math.CO20125 cited

The 2-Domination and 2-Bondage Numbers of Grid Graphs

You Lu, Jun-Ming Xu

Let be a positive integer and be a simple graph. A subset is a -dominating set if each vertex not in has at least neighbors in . The -…

math.CO2012

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\…

math.CO20121 cited

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…

math.CO2012

Conditional Fault Diagnosis of Bubble Sort Graphs under the PMC Model

Shuming Zhou, Jian Wang, Xirong Xu +1

As the size of a multiprocessor system increases, processor failure is inevitable, and fault identification in such a system is crucial for reliable computing. The fault diagnosis…