Bounds on path connectivity |
| |
Authors: | Alon Itai Avram Zehavi |
| |
Institution: | Computer Science Department, Technion-IIT, Haifa, Israel |
| |
Abstract: | The path-connectivity of a graph G is the maximal k for which between any k pairs of vertices there are k edge-disjoint paths (one between each pair). An upper bound for the path-connectivity of nq(q<1) separable graphs 6] is shown to exist.If the edge-connectivity of a graph is KE then between any two pairs of vertices and for every there exists a t?t′?t+1 such that there are t′ paths between the first pair and between the second pair. All paths are edge-disjoint. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|