On strong proper connection number of cubic graphs
Author: Huang, F.; Yuan, J. Description: A path in an edge-colored graph is proper if no two adjacent edges of the path receive the same color. For a connected graph G, the strong proper connection number (SPC number) of G, denoted spc (G), is the minimum number of colors needed to color the edges of G so that every pair of distinct vertices of G is connected by at least one proper geodesic in G. A connected graph G is k-SPC if spc (G) < k. It is implied by…
See more and a link to full text