Open AccessGA2 index of some graph operations
Author(s) -
Gholam Hossein Fath-Tabar,
Asma Hamzeh,
Samaneh Hossein–Zadeh
Publication year - 2010
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1001021f
Subject(s) - mathematics , graph , combinatorics , lying , index (typography) , mathematics subject classification , discrete mathematics , computer science , medicine , world wide web , radiology
Let G = (V, E) be a graph. For e = uv ? E(G), nu (e) is the number of vertices of G lying closer to u than to v and nv (e) is the number of vertices of G lying closer to v than u. The GA2 index of G is defined as ?uv?E(G) 2? nu(e)nv(e) / nu(e) + nv(e). We explore here some mathematical properties and present explicit formulas for this new index under several graph operations. 2010 Mathematics Subject Classifications. 05C12, 05A15, 05A20, 05C05. .