|
|
|
|
study of bounds and extremal graphs of symmetric division degree index for bicyclic graphs with perfect matching
|
|
|
|
|
|
|
|
نویسنده
|
rajpoot abhay ,selvaganesh lavanya
|
|
منبع
|
iranian journal of mathematical chemistry - 2022 - دوره : 13 - شماره : 2 - صفحه:145 -165
|
|
چکیده
|
In this article, we complement the study of pan and li by computing the first five minimum values of the symmetric division degree (sdd) index attained by bicyclic graphs that have a perfect matching. one of our main contributions is identifying the graphs that attain the bounds. further, we compute the upper bound of the sdd index for bicyclic graphs with a maximum degree of four, which admits a perfect matching and prove the bound is also tight by identifying the graphs that attain it.
|
|
کلیدواژه
|
degree based indices ,symmetric division degree index ,bicyclic graphs ,perfect matching ,extremal graphs
|
|
آدرس
|
indian institute of technology (bhu), department of mathematical sciences, india, indian institute of technology (bhu), department of mathematical sciences, india
|
|
پست الکترونیکی
|
lavanyas.mat@iitbhu.ac.in
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|