Strong proper connection number of torus network
I. Annammal Arputhamary, D. Angel · AIP conference proceedings · 2022
In an edge colored graph, a proper path is a path with two neighbouring edges acquire unlike colors. Strongly proper connected graph (SPCG) is a connected graph with the property that there exists a shortest proper path between any two vertices. The strong proper connection number (SPCN) is the minimum number of colors needed for strongly proper connected graph. In this paper, SPCN of Torus network T(r,s) for various values of r and s have been investigated.