Maximal Unicyclic Graphs With Respect to New Atom-bond Connectivity Index

Authors

  • Kinkar Ch. Das Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea.
  • Kexiang Xu College of Science, Nanjing University of Aeronautics & Astronautics, Nanjing, Jiangsu, PR China
  • Ante Graovac Faculty of Science, University of Split, Nikole Tesle 12, HR-21000 Split, Croatia

Keywords:

Unicyclic graph, Atom-bond connectivity (ABC) index, New atom-bond connectivity (ABC2) index, Upper bound

Abstract

The concept of atom-bond connectivity (ABC) index was introduced in the chemical graph theory in 1998. The atom-bond connectivity (ABC) index of a graph G defined as (see formula in text) where E(G) is the edge set and di is the degree of vertex v(i) of G. Very recently Graovac et al. define a new version of the ABC index as (see formula in text) where n(i) denotes the number of vertices of G whose distances to vertex v(i) are smaller than those to the other vertex v(j) of the edge e = v(i) v(j), and n(j) is defined analogously. In this paper we determine the maximal unicyclic graphs with respect to new atom-bond connectivity index (ABC2).

 

Downloads

Published

21.10.2013

Issue

Vol. 60 No. 1 (2013)

Section

Physical chemistry

License

Except where otherwise noted, articles in this journal are published under the Creative Commons Attribution 4.0 International License