|
|
|
|
on edge mostar index of graphs
|
|
|
|
|
|
|
|
نویسنده
|
liu hechao ,song ling ,xiao qiqi ,tang zikai
|
|
منبع
|
iranian journal of mathematical chemistry - 2020 - دوره : 11 - شماره : 2 - صفحه:95 -106
|
|
چکیده
|
The edge mostar index 𝑀𝑜𝑒(𝐺) of a connected graph 𝐺 is defined as 𝑀𝑜𝑒(𝐺)=σ𝑒=𝑢𝑣∈𝐸(𝐺) |𝑚𝑢(𝑒|𝐺)−𝑚𝑣(𝑒|𝐺)|, where 𝑚𝑢(𝑒|𝐺)and 𝑚𝑣(𝑒|𝐺) are, respectively, the number of edges of 𝐺 lying closer to vertex 𝑢 than to vertex 𝑣 and the number of edges of 𝐺 lying closer to vertex 𝑣 than to vertex 𝑢. in this paper, we determine the extremal values of edge mostar index of some graphs. we characterize extremal trees, unicyclic graphs and determine the extremal graphs with maximum and second maximum edge mostar index among cacti with size 𝑚 and 𝑡 cycles. at last, we give some open problems.
|
|
کلیدواژه
|
edge mostar index ,tree ,unicyclic graph ,cacti ,extremal value
|
|
آدرس
|
hunan normal universityhunan normal university, school of mathematics and statistics, china. south china normal university, school of mathematical sciences, china, hunan normal universityhunan normal university, school of mathematics and statistics, china, hunan normal universityhunan normal university, school of mathematics and statistics, china, hunan normal university, school of mathematics and statistics, china
|
|
پست الکترونیکی
|
zikaitang@163.com
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|