On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs
Bin Yang,
Vinayak V. Manjalapur,
Sharanu P. Sajjan,
Madhura M. Mathai and
Jia-Bao Liu
Additional contact information
Bin Yang: Department of Computer Science and Technology, Hefei University, Hefei 230601, China
Vinayak V. Manjalapur: Department of Mathematics, KLE Society’s, Basavaprabhu Kore Arts, Science and Commerce College, Chikodi 591201, Karnataka, India
Sharanu P. Sajjan: Department of Computer Science, Government First Grade College for Women, Jamkhandi 587301, India
Madhura M. Mathai: Department of Mathematics, KLE Society’s, Raja Lakhamagouda Science Institute, Belgaum 590001, Karnataka, India
Jia-Bao Liu: School of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, China
Mathematics, 2019, vol. 7, issue 7, 1-9
Abstract:
For a (molecular) graph G , the extended adjacency index E A ( G ) is defined as Equation (1). In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index. Also, we obtain the extremal acyclic, unicyclic and bicyclic graphs with minimum and maximum of the E A index by a unified method, respectively.
Keywords: degree of vertex; extended adjacency index (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/7/7/652/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/7/652/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:7:p:652-:d:250251
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().