|
|
|
|
the stress of a graph
|
|
|
|
|
|
|
|
نویسنده
|
poojary raksha ,bhat k arathi ,arumugam subramanian ,karantha manjunatha prasad
|
|
منبع
|
communications in combinatorics and optimization - 2023 - دوره : 8 - شماره : 1 - صفحه:53 -65
|
|
چکیده
|
Stress is an important centrality measure of graphs applicable to the study of social and biological networks. we study the stress of paths, cycles, fans and wheels. we determine the stress of a cut vertex of a graph g, when g has at most two cut vertices. we have also identified the graphs with minimum stress and maximum stress in the family of all trees of order n and in the family of all complete bipartite graphs of order n.
|
|
کلیدواژه
|
centrality measure ,ranking of vertices ,path ,tree ,block-graph
|
|
آدرس
|
manipal academy of higher education, prasanna school of public health, department of data science, india, manipal academy of higher education, manipal institute of technology,, department of mathematics, india, kalasalingam academy of research and education, national centre for advanced research in discrete mathematics (n-cardmath), india, manipal academy of higher education, centre for advanced research in applied mathematics and statistics, india
|
|
پست الکترونیکی
|
km.prasad@manipal.edu
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|