|
|
|
|
on eccentric adjacency index of graphs and trees
|
|
|
|
|
|
|
|
نویسنده
|
hashemi vahid ,parsanejad fateme ,sharafdini reza
|
|
منبع
|
بيست و هفتمين سمينار جبر ايران - 1400 - دوره : 2 - بیست و هفتمین سمینار جبر ایران - کد همایش: 00220-76842 - صفحه:0 -0
|
|
چکیده
|
Where sg(u) denotes sum of degrees of vertices adjacent to the vertex u and εg(u) is defined as the maximum length of any minimal path connecting u to any other vertex of g. ##inspired from [jelena sedlar, on augmented eccentric connectivity index of graphs and trees, match commun. math. comput. ##chem. 68 (2012) 325–342.], we establish all extremal graphs with respect to eai among all (simple connected) graphs, among trees and among trees with perfect matching.
|
|
کلیدواژه
|
eccentricity ,tree ,eccentric adjacency in index
|
|
آدرس
|
, iran, , iran, , iran
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|