Fa   |   Ar   |   En
   Extremal Trees For Sombor Index With Given Degree Sequence  
نویسنده Movahedi Fateme
منبع Iranian Journal Of Mathematical Chemistry - 2022 - دوره : 13 - شماره : 4 - صفحه:281 -290
چکیده    Let g=(v, e) be a simple graph with vertex set v and edge set e. the sombor index of the graph g is a degree-based topological index, defined as so(g)= ∑uv∈e √(d(u)2+d(v)2), in which d(x) is the degree of the vertex x∈v for x=u, v. in this paper, we characterize the extremal trees with given degree sequence that minimizes and maximizes the sombor index.
کلیدواژه Sombor Index ,Extremal Tree ,Degree Sequence
آدرس Golestan University, Faculty Of Sciences, Department Of Mathematics, Iran
پست الکترونیکی f.movahedi@gu.ac.ir

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved