The g-Good-Neighbor Diagnosability of Bubble-Sort Graphs under Preparata, Metze, and Chien’s (PMC) Model and Maeng and Malek’s (MM)* Model
Round 1
Reviewer 1 Report
Please see the attachment.
Comments for author File: 
Comments.pdf
Author Response
see the attached file
Author Response File: Author Response.pdf
Reviewer 2 Report
This paper deals with diagnosability of bubble-sort graphs. The authors considered the g-good-neighbor diagnosability of bubble-sort graphs under the PMC model and MM* model. In general, this article is well written and the results are correct. My suggestion is that this paper can be accepted with minor revision.
Minor:
12, has -> have
16, for reliable computing -> in reliable computing
40, the bubble-sort graph, are introduced. -> then bubble-sort graphs will be introduced.
76, Note that Bn is a special Cayley graph -> Note that Bn is a subclass of Cayley graphs.
77, (n - 1)-regular, vertex transitive -> (n - 1)-regular and vertex transitive
189, The proof of Lemma 4 is trivial. -> By the definition of Bn, we have Lemma 4.
328, we has -> we have
366, w are -> w is
432, Because B3 is isomorphic to the star graph S3 -> Because B3 is a cycle with six vertices which is isomorphic to the 3-dimensional star graph
468, Bn under the PMC model and MM* model for g = 0, 1, 2, 3. -> Bn under the PMC model for g = 0, 1, 2, 3 and the MM model for g = 1, 2, 3, respectively.
[11] is not cited in the article.
Suggestion:
"The g-good-neighbor diagnosability of bubble-sort graphs under the PMC model and MM* model" will be a clear title for this article, and authors can consider about it.
Author Response
see the attached file
Author Response File: Author Response.pdf
