检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]School of Mathematics,Zhengzhou University of Aeronautics,Henan 450046,P.R.China [2]College of Sciences,Henan University of Engineering,Henan 451191,P.R.China
出 处:《Journal of Mathematical Research with Applications》2022年第3期221-229,共9页数学研究及应用(英文版)
基 金:Supported by the Foundation of Henan Department of Science and Technology(Grant No.182102310830);the Foundation of Henan University of Engineering(Grant No.D2016018);the Foundation of Henan Educational Committee(Grant Nos.20A110016;2020GGJS239)。
摘 要:For a graph G,the first leap Zagreb index is defined as LM_(1)(G)=∑_(ν∈V(G))d_(2)(v/G)^(2),where d_(2)(v/G) is the 2-distance degree of a vertex v in G.Let QT^(k)(n) be the set of kgeneralized quasi-trees with n vertices.In this paper,we determine the extremal elements from the set QT^(k)(n) with respect to the first leap Zagreb index.
关 键 词:k-generalized quasi-trees the first leap Zagreb index 2-distance degree
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229