References
- B. Ben-Moshe, B. Bhattacharya, and Q. Shi, Efficient algorithms for the weighted 2-center problem in a cactus graph, Algorithms and Computation, 16th Int. Symp., ISAAC 2005, Lecture Notes in Computer Science 3827, pp. 693-03, Springer-Verlag, 2005.
- J. Chen and X. Guo, Extreme atom-bond connectivity index of graphs, MATCH Commun. Math. Comput. Chem. 65 (2011), no. 3, 713-722.
- K. C. Das, Atom-bond connectivity index of graphs, Discrete Appl. Math. 158 (2010), no. 11, 1181-1188. https://doi.org/10.1016/j.dam.2010.03.006
- K. C. Das, I. Gutman, and B. Furtula, On atom-bond connectivity index, Chem. Phys. Lett. 511 (2011), 452-454. https://doi.org/10.1016/j.cplett.2011.06.049
- T. Dehghan-Zadeh, A. R. Ashrafi, and N. Habibi, Maximum values of atom-bond connectivity index in the class of tetra-cyclic graphs, submitted.
- E. El-Mallah and C. Colbourn, The complexity of some edge deletion problems, IEEE Trans. Circuits and Systems 35 (1988), no. 3, 354-362. https://doi.org/10.1109/31.1748
- E. Estrada, Atom-bond connectivity and the energetic of branched alkanes, Chem. Phys. Lett. 463 (2008), 422-425. https://doi.org/10.1016/j.cplett.2008.08.074
- E. Estrada, L. Torres, L. Rodriguez, and I. Gutman, An atom-bond connectivity index: modeling the enthalpy of formation of alkanes, Indian J. Chem. 37A (1998), 849-855.
- G. H. Fath-Tabar, B. Vaez-Zadeh, A. R. Ashrafi, and A. Graovac, Some inequalities for the atom-bond connectivity index of graph operations, Discrete Appl. Math. 159 (2011), no. 13, 1323-1330. https://doi.org/10.1016/j.dam.2011.04.019
- B. Furtula, A. Graovac, and D. Vukicevic, Atom-bond connectivity index of trees, Discrete Appl. Math. 157 (2009), no. 13, 2828-2835. https://doi.org/10.1016/j.dam.2009.03.004
- L. Gan, H. Hou, and B. Liu, Some results on atom-bond connectivity index of graphs, MATCH Commun. Math. Comput. Chem. 66 (2011), no. 2, 669-680.
- L. Gan, B. Liu, and Z. You, The ABC index of trees of given degree sequence, MATCH Commun. Math. Comput. Chem. 68 (2012), no. 1, 137-145.
- I. Gutman and B. Furtula, Trees with smallest atom-bond connectivity index, MATCH Commun. Math. Comput. Chem. 68 (2012), no. 1, 131-136.
- I. Gutman, B. Furtula, and M. Ivanovic, Notes on trees with minimal atom-bond connectivity index, MATCH Commun. Math. Comput. Chem. 67 (2012), no. 2, 467-482.
- N. M. Korneyenko, Combinatorial algorithms on a class of graphs, Discrete Appl. Math. 54 (1994), no. 2-3, 215-217. https://doi.org/10.1016/0166-218X(94)90022-1
- M. Lu, L. Zhang, and F. Tian, On the Randic index of cacti, MATCH Commun. Math. Comput. Chem. 56 (2006), no. 3, 551-556.
- B. Paten, M. Diekhans, D. Earl, J. St. John, J. Ma, B. Suh, and D. Haussler, Cactus graphs for genome comparisons, J. Comput. Biol. 18 (2011), no. 3, 469-481. https://doi.org/10.1089/cmb.2010.0252
- D. B. West, Introduction to Graph Theory, Prentice Hall, Upper Saddle River, 2001.
- R. Xing, B. Zhou, and F. Dong, On atom-bond connectivity index of connected graphs, Discrete Appl. Math. 159 (2011), no. 15, 1617-1630. https://doi.org/10.1016/j.dam.2011.06.004
- R. Xing, B. Zhou, and Z. Du, Further results on atom-bond connectivity index of trees, Discrete Appl. Math. 158 (2010), no. 14, 1536-1545. https://doi.org/10.1016/j.dam.2010.05.015
Cited by
- The first multiplication atom-bond connectivity index of molecular structures in drugs vol.25, pp.4, 2017, https://doi.org/10.1016/j.jsps.2017.04.021