nach oben

Journal of Applied Mathematics and Computing

Erschienen in:

27.06.2019 | Original Research

Eccentric connectivity coindex under graph operations

verfasst von: Mahdieh Azari

Erschienen in: Journal of Applied Mathematics and Computing | Ausgabe 1-2/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The eccentric connectivity coindex is defined as the total eccentricity sum of all non-adjacent vertex pairs in a connected graph. In this paper, we present exact expressions or sharp lower bounds for the eccentric connectivity coindex of several graph operations such as sum, disjunction, symmetric difference, lexicographic product, generalized hierarchical product, Cartesian product, rooted product, corona product, and strong product.

Vorheriger Artikel A robust numerical method for pricing American options under Kou’s jump-diffusion models based on penalty method

Nächster Artikel A two-step improved Newton method to solve convex unconstrained optimization problems

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Hage, P., Harary, F.: Eccentricity and centrality in networks. Soc. Netw. 17, 57–63 (1995)CrossRef

Diudea, M.V.: QSPR/QSAR Studies by Molecular Descriptors. NOVA, New York (2001)

Gutman, I., Trinajstić, N.: Graph theory and molecular orbitals. Total \(\pi \)-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 17, 535–538 (1972)CrossRef

Gutman, I., Ruščić, B., Trinajstić, N., Wilcox, C.F.: Graph theory and molecular orbitals. XII. Acyclic polyenes. J. Chem. Phys. 62, 3399–3405 (1975)CrossRef

Borovićanin, B., Das, K.C., Furtula, B., Gutman, I.: Bounds for Zagreb indices. MATCH Commun. Math. Comput. Chem. 78, 17–100 (2017)MathSciNet

Ali, A., Gutman, I., Milovanović, E., Milovanović, I.: Sum of powers of the degrees of graphs: extremal results and bounds. MATCH Commun. Math. Comput. Chem. 80, 5–84 (2018)MathSciNet

Gutman, I., Milovanović, E., Milovanović, I.: Beyond the Zagreb indices. AKCE Int. J. Graphs Comb. (2018). https://doi.org/10.1016/j.akcej.2018.05.002 CrossRefMATH

Ali, A., Zhong, L., Gutman, I.: Harmonic index and its generalizations: extremal results and bounds. MATCH Commun. Math. Comput. Chem. 81, 249–311 (2019)

Došlić, T.: Vertex-weighted Wiener polynomials for composite graphs. Ars Math. Contemp. 1, 66–80 (2008)MathSciNetCrossRef

10.

Ashrafi, A.R., Došlić, T., Hamzeh, A.: The Zagreb coindices of graph operations. Discrete Appl. Math. 158, 1571–1578 (2010)MathSciNetCrossRef

11.

Gutman, I., Furtula, B., Kovijanić Vukićević, Ž., Popivoda, G.: On Zagreb indices and coindices. MATCH Commun. Math. Comput. Chem. 74, 5–16 (2015)MathSciNetMATH

12.

Sharma, V., Goswami, R., Madan, A.K.: Eccentric connectivity index: a novel highly discriminating topological descriptor for structure–property and structure–activity studies. J. Chem. Inf. Comput. Sci. 37, 273–282 (1997)CrossRef

13.

Ilić, A., Gutman, I.: Eccentric connectivity index of chemical trees. MATCH Commun. Math. Comput. Chem. 65, 731–744 (2011)MathSciNetMATH

14.

Morgan, M.J., Mukwembi, S., Swart, H.C.: A lower bound on the eccentric connectivity index of a graph. Discrete Appl. Math. 160(3), 248–258 (2012)MathSciNetCrossRef

15.

Xu, K., Li, X.: Comparison between two eccentricity-based topological indices of graphs. Croat. Chem. Acta 89, 499–504 (2016)CrossRef

16.

Hua, H., Miao, Z.: The total eccentricity sum of non-adjacent vertex pairs in graphs. Bull. Malays. Math. Sci. Soc. 42(3), 947–963 (2019)MathSciNetCrossRef

17.

Hammack, R., Imrich, W., Klavžar, S.: Handbook of Product Graphs, 2nd edn. CRC Press, Boca Raton (2011)CrossRef

18.

Tavakoli, M., Rahbarnia, F., Ashrafi, A.R.: Note on strong product of graphs. Kragujev. J. Math. 37(1), 187–193 (2013)MathSciNetMATH

19.

Azari, M., Iranmanesh, A.: Computing the eccentric-distance sum for graph operations. Discrete Appl. Math. 161(18), 2827–2840 (2013)MathSciNetCrossRef

20.

Azari, M.: Sharp lower bounds on the Narumi–Katayama index of graph operations. Appl. Math. Comput. 239C, 409–421 (2014)MathSciNetMATH

21.

Fathalikhani, K., Faramarzi, H., Yousefi-Azari, H.: Total eccentricity of some graph operations. Electron. Notes Discret. Math. 45, 125–131 (2014)CrossRef

22.

Azari, M.: Some variants of the Szeged index under rooted product of graphs. Miskolc Math. Notes 17(2), 761–775 (2016)MathSciNetCrossRef

23.

De, N., Nayeem, S.M.A., Pal, A.: F-index of some graph operations. Discrete Math. Algorithms Appl. 8(2), 1650025 (2016)MathSciNetCrossRef

24.

Veylaki, M., Nikmehr, M.J., Tavallaee, H.A.: The third and hyper-Zagreb coindices of graph operations. J. Appl. Math. Comput. 50(1–2), 315–325 (2016)MathSciNetCrossRef

25.

Basavanagoud, B., Patil, S.: A note on hyper-Zagreb coindex of graph operations. J. Appl. Math. Comput. 53(1–2), 647–655 (2017)MathSciNetCrossRef

26.

Gao, W., Jamil, M.K., Farahani, M.R.: The hyper-Zagreb index and some graph operations. J. Appl. Math. Comput. 54(1–2), 263–275 (2017)MathSciNetCrossRef

27.

Hossein-Zadeh, S., Iranmanesh, A., Hosseinzadeh, M.A., Hamzeh, A., Tavakoli, M., Ashrafi, A.R.: Topological efficiency under graph operations. J. Appl. Math. Comput. 54(1–2), 69–80 (2017)MathSciNetCrossRef

28.

Nacaroglu, Y., Maden, A.D.: The upper bounds for multiplicative sum Zagreb index of some graph Operations. J. Math. Ineqal. 11(3), 749–761 (2017)MathSciNetCrossRef

29.

Azari, M.: Further results on non-self-centrality measures of graphs. Filomat 32(14), 5137–5148 (2018)MathSciNetCrossRef

30.

Barrière, L., Dalfó, C., Fiol, M.A., Mitjana, M.: The generalized hierarchical product of graphs. Discrete Math. 309(12), 3871–3881 (2009)MathSciNetCrossRef

Titel: Eccentric connectivity coindex under graph operations
verfasst von: Mahdieh Azari
Publikationsdatum: 27.06.2019
Verlag: Springer Berlin Heidelberg
Erschienen in: Journal of Applied Mathematics and Computing / Ausgabe 1-2/2020
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI: https://doi.org/10.1007/s12190-019-01271-0

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 1-2/2020

Comparative study on difference schemes for singularly perturbed boundary turning point problems with Robin boundary conditions

Existence and uniqueness of solutions for fractional q-difference Schrödinger equations

Novel numerical method of the fractional cable equation

Karush–Kuhn–Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions

Mathematical modeling and dynamic analysis of anti-tumor immune response

Hulls of linear codes revisited with applications