80
Views
16
CrossRef citations to date
0
Altmetric
Articles

M-Polynomial and topological indices of book graph

, , , &

References

  • F. Afzal, S. Hussain, D. Afzal, S. Razaq. Some new degree based topological indices via m-polynomial. Journal of Information and Optimization Sciences, 41(4):1061-1076, 2020. DOI:10.1080/02522667.2020.1744307.
  • T. Balaban. Highly discriminating distance based numerical descriptor. Chemical Physics Letters, 89(5):399–404, 1982. https://doi.org/10.1016/0009-2614(82)80009-2
  • A. Bollobas and P. Erdos. Graphs of extremal weights. Ars Combinatoria, 50:225–233, 1998.
  • M. Cancan, S. Ediz, H. Mutee-Ur-Rehman, and D. Afzal. M-polynomial and topological indices poly (EThyleneAmidoAmine) dendrimers. Journal of Information and Optimization Sciences, 41(4):1117–1131, 2020. DOI:10.1080/02522667.2020.1745383.
  • E. Deutsch and S. KlavŽar. M-polynomial and degree-based topological indices. Iranian Journal of Mathematical Chemistry, 6(2):93–102, 2015. https://doi.org/10.22052/ijmc.2015.10106
  • E. Estrada, L. Torres, L. Rodríguez, and I. Gutman. An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes. Indian Journal of Chemistry, 37(10):849–855, 1998.
  • S. Fajtlowicz. On conjectures of graffiti II. Congr, 60:189–197, 1987.
  • B. Furtula, A. Graovac, and D. VukičeviĆ. Augmented zagreb index. Journal of Mathematical Chemistry, 48(2):370–380, 2010. https://doi.org/10.1007/s10910-010-9677-3
  • I. Gutman and N. TrinajstiĆ. Graph theory and molecular orbitals. total ϕ -electron energy of alternant hydrocarbons. Chemical Physics Letters, 17(4):535–538, 1972. https://doi.org/10.1016/0009-2614(72)85099-1
  • S. M. Kang, W. Nazeer, W. Gao, D. Afzal, and S. N. Gillani. M-polynomials and topological indices of dominating david derived networks. Open Chemistry, 16(1):201–213, 2018. https://doi.org/10.1515/chem-2018-0023
  • R. Khalid, N. Idrees, and M. J. Saif. Topological characterization of book graph and stacked book graph. Computers, Materials & Continua, 60(1):41–54, 2019. doi:10.32604/cmc.2019.06554
  • V. Kulli. On K banhatti indices of graphs. Journal of Computer and Mathematical Sciences, 7(04):213–218, 2016. http://www.compmath-journal.org/
  • V. Kulli. On K hyper banhatti indices and coindices of graphs. International Research Journal of Pure Algebra, 6(5):300–304, 2016. http://www.rjpa.info/index.php/rjpa
  • V. Kulli. New K-banhatti topological indices. International Journal of Fuzzy Mathematical Archive, 12(1):29–37, 2017.DOI: http://doi.org/10.22457/ijfma.v12n1a4
  • S. NikoliĆ, G. KovaČeviĆ, A. MiliČeviĆ, and N. TrinajstiĆ. The zagreb indices 30 years after. Croatoca Chemica Acta, 76(2):113–124, 2003. url: https://hrcak.srce.hr/103086
  • M. Randić. Characterization of molecular branching. Journal of the American Chemical Society, 97(23):6609–6615, 1975. doi:10.1021/ja00856a001
  • A. ur Rehman Virk and M. Quraish. Some invariants of flower graph. Applied Mathematics and Nonlinear Sciences, 3(2):427–432, 2018. doi: 10.21042/AMNS.2018.2.00033
  • D. VukičeviĆ and M. Gasperov. Bond additive modeling 1. adriatic indices. Croat. Chem. Acta, 83(3):243–260, 2010. url: https://hrcak.srce.hr/62202
  • D. VukiČeviĆ and B. Furtula. Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. Journal of Mathematical Chemistry, 46(4):1369–1376, 2009. https://doi.org/10.1007/s10910-009-9520-x
  • X. Zhang, A. Razzaq, K. Ali, S.T.R. Rizvi, M.R. Farahani. Anewapproach to find eccentric indices of some graphs. Journal of Information & Optimization Sciences. 41(4), 2020, 865–877. DOI:10.1080/02522667.2020.1744304
  • M.S. Sardar, S-A. Xu, W. Sajjad, S. Zafar, I.N. Cangul, M.R. Farahani. An explicit formula for the harmonic indices and harmonic polynomials of carbon nanocones CNCk[n], Journal of Information and Optimization Sciences, 41(4), 2020, 879–890 DOI:10.1080/02522667.2020.1753304
  • M.N. Husin, F. Asif, Z. Zahid, S. Zafar. On topological properties of some convex polytopes by using line operator on their subdivisions, Journal of Information and Optimization Sciences, 41(4), 2020, 891–903 DOI:10.1080/02522667.2020.1744305
  • Z. Ahmad, A.Q. Baig, M.R. Azhar, M. Imran. Total eccentricity and average eccentricity indices of some chemical graphs: Carbon graphite and copper oxide. Journal of Information and Optimization Sciences, 41(4), 2020, 905–924. DOI:10.1080/02522667.2020.1745379
  • M. Cancan, S. Ediz, S. Fareed, M.R. Farahani. More topological indices of generalized prism network, Journal of Information and Optimization Sciences, 41(4), 2020, 925–932 DOI:10.1080/02522667.2020.1748273
  • M. Alaeiyan, F. Afzal, M.R. Farahani, M.A. Rostami. An exact formulas for the Wiener polarity index of nanostar dendrimers, Jour- nal of Information and Optimization Sciences, 41(4), 2020, 933–939. DOI:10.1080/02522667.2020.1748274
  • M.N. Husin, A. Ariffin, M. Alaeiyan. The neighbourhood polynomial of certain networks, Journal of Information and Optimization Sciences, 41(4), 2020, 941–948. DOI:10.1080/02522667.2020.1748275
  • M. Cancan, S. Ediz, M. Alaeiyan, M.R. Farahani. On Ve-degree molecular properties of copper oxide. Journal of Information and Optimization Sciences, 41(4), 2020, 949–957. DOI:10.1080/02522667.2020.1747191
  • W. Sajjad, M.S. Sardar, M. Cancan, S. Ediz, A.Q. Baig. On modified eccentric connectivity index of nanotube, Journal of Information and Optimization Sciences, 41(4), 2020, 959–972. DOI:10.1080/02522667.2020.1745380

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.