Next Article in Journal
L1-Norm Robust Regularized Extreme Learning Machine with Asymmetric C-Loss for Regression
Next Article in Special Issue
On Several Parameters of Super Line Graph L2(G)
Previous Article in Journal
On the Structure of Coisometric Extensions
Previous Article in Special Issue
The Decomposability of Toroidal Graphs without Adjacent Triangles or Short Cycles
 
 
Article
Peer-Review Record

Extremal Graphs for Sombor Index with Given Parameters

by Wanping Zhang, Jixiang Meng * and Na Wang
Reviewer 1:
Reviewer 2: Anonymous
Reviewer 3: Anonymous
Submission received: 10 January 2023 / Revised: 3 February 2023 / Accepted: 9 February 2023 / Published: 15 February 2023
(This article belongs to the Special Issue Graph Theory and Discrete Applied Mathematics)

Round 1

Reviewer 1 Report


Comments for author File: Comments.pdf

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Reviewer 2 Report

The results of the article are good, but the written language is bad. I think the authors should improve their written language

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Reviewer 3 Report

Authors study extremal graphs for special Sombor index with given parameters. According my opinion, the paper is written well, the topic is very actual. Different indexes were studied in the past time and many results are done in this area of research. The authors brings also new own results in this topic for special parameters of graphs. Therefore I recommend the publication of the paper under small revisions  listed bellow:

 

1/Abstract: Please there is necessity to change and modify abstract:   1/2 in the Abstract...please there is written: connected graphs {resp. bipartite graphs}....please this needs to be mathematically clear....you consider...connected, or connected bipartite, or just bipartite...make it absolutely clear

1/4 in the Abstract: number.resp....please insert  a space behind "number"

1/2, 3..Please make clear what you mean ..  write sentences without parenthesis........among connected graphs with given chromatic number (resp. girt and matching number)..please reformulate it and make it clear and simple.

1/Introduction...first line....please you write  finite, undirected and simple graphs.    Here is connected? Or bipartite? How does it is connected with the abstract?

2/7 Please insert a space: "Sun et al.[23]"...please insert a space behind at al.

4/-6  Please insert at the end of the proof an usual graphical symbol "an empty square". Please correct this in the whole paper.

12/-  Please correct: "the proof of this theorem" into "The proof of the Theorem xy."

 

14/Concluding remarks...Please insert some open questions and future lines of this research.

 

 

 

 

Author Response

Please see the attachment.

Author Response File: Author Response.pdf

Back to TopTop