Back close

An optimum resource score estimation method using Bipartite graph model and single node systematic sampling,

Publication Type : Journal Article

Source : Reliability: Theory and Applications

Campus : Haridwar

School : School of Engineering

Year : 2021

Abstract : Consider a graphical population of vertices (nodes) and edges, where edges are connected with vertices to form a Bipartite graph. A complete Bipartite graph has vertices that can be partitioned into two subsets such that no edge has both endpoints in the same subset, and every possible edge connected to vertices in different subsets is a part of graph. In real life, there may hundreds of cities where at least one possible way exists reaching source to destinations. Several tourist places and small towns are the examples where the road transportation is available between origin and destination and these roads constitute Bipartite graph when they are like edges. The travel needs resource consumption who could be measured through resource-score. Walking at the hill station needs more energy consumption than at the plane area. This paper suggests an example to estimate the resource consumption by the values of score. Further, paper proposes a sample based methodology for calculating the average resource consumption between a pair of small town (city) and tourist place. Bipartite graph is used as a model tool. A single-node systematic sampling procedure is proposed under the Bipartite graph setup which is found useful for solution. The suggested estimation strategy is optimum at specific choice of parametric values. For quick selection, ready-reckoner tables are prepared who provide immediate optimum choice of constant. Results are numerically supported by the empirical study and proved by the calculation of confidence intervals.

Cite this Research Publication : Deepika Rajoriya, D.Shukla, An optimum resource score estimation method using Bipartite graph model and single node systematic sampling, Reliability: Theory and Applications, vol. 16, 322-338, ISSN: 1932-2321, 2021.

Admissions Apply Now