We present a complex weighted network analysis of a bus transport network. We model the network as graphs in L-space and P-space and evaluate the statistical properties in unweighted and weighted cases. The weights considered include number of overlapping routes and passenger demand between two bus stops. We also introduce a new supply-based edge weight called Service Utilization Factor () and define it as the passenger demand per service between two stops. We extract the origin and destination of the passenger trips from bus ticket information. In the bus system under study, the tickets are issued between ’stages’ instead of between bus stops. We propose a points of interest based procedure to map the passenger demand between stages to between bus stops. The network has scale-free behaviour with preferential attachment of nodes and is similar to small-world networks. It is well-connected with an average of 1.4 transfers required to travel between any two points in the network. We identify redundant routes in the network from strength values in the SUF weighted networks. Disassortativity in the demand weighted network indicated that bus stops with higher attractiveness are not necessarily situated contiguously along a route. The SUF weighted network is assortative indicating presence of well-serviced stops along the same the route. We identified the stops with higher betweenness centrality, that can be ideal candidates for being developed as hubs. Our conclusions exemplify the importance of considering route overlaps, passenger demand and service utilization in bus network analysis and for building an efficient bus network.