Abstract

AbstractIn this paper, confluence vertices in distribution networks are discussed from the point of view of network topology, to solve the problems that require a number of confluence vertices before hydraulic calculation. First, open and closed network models are introduced to represent the different types of distribution networks and constructed based on the general assumptions. Six propositions are proven according to graph theory to reveal the relationship between the number of confluence vertices and the network topology, not only based on the general assumptions but also the strict assumptions with additional limitation on the degree of vertices. Besides, the equations also reveal the relationship between the number of confluence vertices and the number of independent loops in the network models with the strict assumptions. Through discussion of hydraulic variations, the number of confluence vertices in the network model that follows the strict assumptions is dependent only on the network topology a...

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call