k-Path-Connectivity of Completely Balanced Tripartite Graphs
Round 1
Reviewer 1 Report
The authors consider the k-path-connectivity of complete balanced tripartite graphs. The k-path-connectivity extends the typical notion of connectivity which is determined by the number of disjoint paths linking two vertices to the number of disjoint paths linking k vertices. Hager conjectured a link between k-path-connectivity and connectivity, which is confirmed by the authors in this class of graphs. The constructions are straightforward and may provide insights for more general classes of graphs, such as complete tripartite or balanced multipartite. The paper is well written and the proofs appear to be correct. I recommend acceptance, noting the following corrections:
Line 165: when -> When
Line 218: delete the second "and the connectivity of graphs"
Author Response
Please see the attachment.
Author Response File: Author Response.pdf
Reviewer 2 Report
Please see attatched report.
Comments for author File: Comments.pdf
Author Response
Please see the attachment.
Author Response File: Author Response.pdf