The primitive index about K-bridge graphs
Nian X. Sun · Journal of Xian University Engineering Science and Technology · 2005
K-bridge graph is a graph composed of K internally-disjotint paths connecting two vertices A and B.Primitive index of primitive K-bridge graph is calculated.It equals either m-1 or n-1,here m is length of the longest odd-cycle,n is sum of the lengthes of the longest odd-path (even-path) and the shortest even-path (odd-path) between A and B.