This paper addresses the issue of dynamic connectivity reliability in a public transportation network, which is based on bus routes and schedules. A dynamic k-shortest path algorithm is used to find up to "k" bus paths connecting each Origin-Destination pair in {time x space}. The connectivity reliability is determined by the basic reliability "p" of each path element, and standardized reliability indicators have been defined. Equations have been developed that relate the reliability of a specific Origin-Destination pair or the entire network to various factors such as the number of path elements, the number of paths (taking into account their degree of overlap), the straightness of the routes, and bus frequencies. This enables operators to assess and compare solutions that can enhance the quality of service by improving the basic reliability, increasing the number of alternative bus lines, straightening the routes, and increasing bus frequencies.