@article{oai:ous.repo.nii.ac.jp:00000824,
 author = {加藤, 常員 and Kato, Tunekazu},
 journal = {岡山理科大学紀要. A, 自然科学, Bulletin of Okayama University of Science. A, Natural Sciences},
 month = {Mar},
 note = {P(論文), The initial weight of each vertices in transformed into a new weight by a monotonously increasing convex function in a network, when considering the shortest path problem to find out all of the shortest paths from one vertex to all the other vertices for the new weight. The graph given by the shortest path problem of this type is composed of a tree consisting of sub-paths (vertices) each of which are the shortest path between the vertices. The tree (the shortest path) changes according to types of the functions used for weight. For a sufficiently rapidly increasing function, we show that the tree consisting of the shortest paths agrees with the minimum spanning tree. The change of a tree by using a different convex function for weight is called a junction effect. We discuss the properties of the junction effect. By using a nonnegative real number for the weight, a numerical computer experiment is performed and its results are also presented.},
 pages = {149--160},
 title = {中継効果の諸属性に関しての考察},
 volume = {24},
 year = {1989},
 yomi = {カトウ, ツネカズ}
}