A New Parameter for the Connectivity in Depictive Graphs

The concept of Nth side edge-toughness is proposed on the basis of edge-toughness, and a new parameter to depict the connectivity of graphs, the coupling degree, is defined, with some of its properties presented. Through the comparison of the parameters like the connectivity, toughness and creativity by examples, the accuracy of the coupling degree is proved in depicting connectivity of some graphs.