On the shortest path in some k-connected graphs
Suppose G is a connected graph and u and v are two distinct vertices of G. Let],[vuP be the
shortest path in G with endpoints u and v. Let)}(,:|]),[({|)(GVvu vuPV max Gt∈=. A graph G is
said to be k-connected if it has more than k vertices and removal of fewer than k vertices
does not disconnect the graph G. We show that in any k-connected graph G with n vertices,.
2 2
shortest path in G with endpoints u and v. Let)}(,:|]),[({|)(GVvu vuPV max Gt∈=. A graph G is
said to be k-connected if it has more than k vertices and removal of fewer than k vertices
does not disconnect the graph G. We show that in any k-connected graph G with n vertices,.
2 2
以上显示的是最相近的搜索结果。 查看全部搜索结果