The purpose of this paper is to characterize convenient position-values to evaluate nodes on such a connected undirected graph by use of the eigenvalues and eigenvectors of the adjacency matrix. First, we explorer the best location which maximizes convenient position-value according to corresponding graphs. Then, we derive the continuous distribution of convenient position-value by use of eigenfunction in order to explore how the size of the study area affects the total convenient position-values. Finally, we show the difference between convenient position-value and standard location criteria through illustrative examples.
