شماره ركورد كنفرانس :
5440
عنوان مقاله :
On eccentric adjacency index of graphs and trees
پديدآورندگان :
HASHEMI VAHID Faculty of intelligent systems engineering and data science, Persian Gulf University , PARSANEJAD FATEME f.parsanezhad73@yahoo.com Faculty of intelligent systems engineering and data science, Persian Gulf University, Bushehr , SHARAFDINI REZA Faculty of intelligent systems engineering and data science, Persian Gulf University, Bushehr
كليدواژه :
eccentricity , tree , eccentric adjacency in index
عنوان كنفرانس :
بيست و هفتمين سمينار جبر ايران
چكيده فارسي :
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.