Skip to main content
Erschienen in: Journal of Applied Mathematics and Computing 1-2/2021

07.01.2021 | Original Research

On Connected Graphs Having the Maximum Connective Eccentricity Index

verfasst von: Shahid Zaman, Akbar Ali

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

Einloggen

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

search-config
loading …

Abstract

The connective eccentricity index (CEI) of a connected graph G is defined as \(\xi ^{ee}(G)=\sum _{u\in V_G}[d_G(u)/\varepsilon _G(u)]\), where \(d_G(u)\) and \(\varepsilon _G(u)\) are the degree and eccentricity, respectively, of the vertex \(u\in V_G\) of G. In this paper, graphs with the maximum CEI are characterized from the class of all connected graphs of a fixed order and size. Graphs having maximum CEI are also determined from some other well-known classes of connected graphs of a given order; namely, the Halin graphs, triangle-free graphs, planar graphs and outer-planar graphs.

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!

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!

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!

Literatur
1.
Zurück zum Zitat Ashrafi, A.R., Saheli, M., Ghorbani, M.: The eccentric connectivity index of nanotubes and nanotori. J. Comput. Appl. Math. 235, 4561–4566 (2011)MathSciNetCrossRef Ashrafi, A.R., Saheli, M., Ghorbani, M.: The eccentric connectivity index of nanotubes and nanotori. J. Comput. Appl. Math. 235, 4561–4566 (2011)MathSciNetCrossRef
2.
Zurück zum Zitat Basavaraju, M.: Acyclic chromatic index of fully subdivided graphs and Halin graphs. Discrete Math. Theor. Comput. Sci. 14, 165–172 (2012)MathSciNetMATH Basavaraju, M.: Acyclic chromatic index of fully subdivided graphs and Halin graphs. Discrete Math. Theor. Comput. Sci. 14, 165–172 (2012)MathSciNetMATH
3.
Zurück zum Zitat Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, Berlin (2008) Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, Berlin (2008)
4.
Zurück zum Zitat Chan, W., Lam, P., Shiu, W.C.: Edge-face total chromatic number of Halin graphs. SIAM J. Discrete Math. 23, 1646–1654 (2009)MathSciNetCrossRef Chan, W., Lam, P., Shiu, W.C.: Edge-face total chromatic number of Halin graphs. SIAM J. Discrete Math. 23, 1646–1654 (2009)MathSciNetCrossRef
5.
Zurück zum Zitat Chartrand, G., Lesniak, L., Zhang, P.: Graphs & Digraphs, 6th edn. CRC Press, Boca Raton (2016)MATH Chartrand, G., Lesniak, L., Zhang, P.: Graphs & Digraphs, 6th edn. CRC Press, Boca Raton (2016)MATH
6.
Zurück zum Zitat Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. Henri Poincaré 3, 433–438 (1967)MathSciNetMATH Chartrand, G., Harary, F.: Planar permutation graphs. Ann. Inst. Henri Poincaré 3, 433–438 (1967)MathSciNetMATH
7.
8.
Zurück zum Zitat Dankelmann, P., Goddard, W., Swart, C.S.: The average eccentricity of a graph and its subgraphs. Util. Math. 65, 41–51 (2004)MathSciNetMATH Dankelmann, P., Goddard, W., Swart, C.S.: The average eccentricity of a graph and its subgraphs. Util. Math. 65, 41–51 (2004)MathSciNetMATH
9.
Zurück zum Zitat De, N.: Bounds for connective eccentric index. Int. J. Contemp. Math. Sci. 7(44), 2161–2166 (2012)MathSciNetMATH De, N.: Bounds for connective eccentric index. Int. J. Contemp. Math. Sci. 7(44), 2161–2166 (2012)MathSciNetMATH
10.
Zurück zum Zitat Dureja, H., Gupta, S., Madan, A.K.: Predicting anti-HIV-1 activity of 6-arylbenzonitriles: computational approach using superaugmented eccentric connectivity topochemical indices. J. Mol. Graph. Model. 26, 1020–1029 (2008)CrossRef Dureja, H., Gupta, S., Madan, A.K.: Predicting anti-HIV-1 activity of 6-arylbenzonitriles: computational approach using superaugmented eccentric connectivity topochemical indices. J. Mol. Graph. Model. 26, 1020–1029 (2008)CrossRef
11.
Zurück zum Zitat Ghorbani, M.: Connective eccentric index of fullerenes. J. Math. Nanoscience 1, 43–52 (2011) Ghorbani, M.: Connective eccentric index of fullerenes. J. Math. Nanoscience 1, 43–52 (2011)
12.
Zurück zum Zitat Ghorbani, M., Malekjani, K.: A new method for computing the eccentric connectivity index of fullerenes. Serdica J. Comput. 6, 299–308 (2012)MathSciNetMATH Ghorbani, M., Malekjani, K.: A new method for computing the eccentric connectivity index of fullerenes. Serdica J. Comput. 6, 299–308 (2012)MathSciNetMATH
13.
Zurück zum Zitat Gupta, S., Singh, M., Madan, A.K.: Connective eccentricity index: a novel topological descriptor for predicting biological activity. J. Mol. Graph. Model. 18, 18–25 (2000)CrossRef Gupta, S., Singh, M., Madan, A.K.: Connective eccentricity index: a novel topological descriptor for predicting biological activity. J. Mol. Graph. Model. 18, 18–25 (2000)CrossRef
14.
Zurück zum Zitat Gupta, S., Singh, M., Madan, A.K.: Application of graph theory: relationship of eccentric connectivity index and Wiener index with anti-inflammatory activity. J. Math. Anal. Appl. 266, 259–268 (2002)MathSciNetCrossRef Gupta, S., Singh, M., Madan, A.K.: Application of graph theory: relationship of eccentric connectivity index and Wiener index with anti-inflammatory activity. J. Math. Anal. Appl. 266, 259–268 (2002)MathSciNetCrossRef
15.
Zurück zum Zitat Gupta, S., Singh, M., Madan, A.K.: Eccentric distance sum: a novel graph invariant for predicting biological and physical properties. J. Math. Anal. Appl. 275(1), 386–401 (2002)MathSciNetCrossRef Gupta, S., Singh, M., Madan, A.K.: Eccentric distance sum: a novel graph invariant for predicting biological and physical properties. J. Math. Anal. Appl. 275(1), 386–401 (2002)MathSciNetCrossRef
17.
Zurück zum Zitat He, C.L., Li, S.C., Wang, M.T.: On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum. Discrete Appl. Math. 221, 71–81 (2017)MathSciNetCrossRef He, C.L., Li, S.C., Wang, M.T.: On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum. Discrete Appl. Math. 221, 71–81 (2017)MathSciNetCrossRef
18.
Zurück zum Zitat Ilić, A.: On the extremal properties of the average eccentricity. Comput. Math. Appl. 64, 2877–2885 (2012)MathSciNetCrossRef Ilić, A.: On the extremal properties of the average eccentricity. Comput. Math. Appl. 64, 2877–2885 (2012)MathSciNetCrossRef
19.
Zurück zum Zitat Kumar, V., Sardana, S., Madan, A.K.: Predicting anti-HIV activity of 2, 3-diaryl-1, thiazolidin-4-ones: computational approach using reformed eccentric connectivity index. J. Mol. Model. 10, 399–407 (2004)CrossRef Kumar, V., Sardana, S., Madan, A.K.: Predicting anti-HIV activity of 2, 3-diaryl-1, thiazolidin-4-ones: computational approach using reformed eccentric connectivity index. J. Mol. Model. 10, 399–407 (2004)CrossRef
20.
Zurück zum Zitat Lai, H., Lih, K., Tsai, P.: The strong chromatic index of Halin graphs. Discrete Math. 312, 1536–1541 (2012)MathSciNetCrossRef Lai, H., Lih, K., Tsai, P.: The strong chromatic index of Halin graphs. Discrete Math. 312, 1536–1541 (2012)MathSciNetCrossRef
21.
Zurück zum Zitat Li, H., Li, S.C., Zhang, H.: On the maximal connective eccentricity index of bipartite graphs with some given parameters. J. Math. Anal. Appl. 454, 453–467 (2017)MathSciNetCrossRef Li, H., Li, S.C., Zhang, H.: On the maximal connective eccentricity index of bipartite graphs with some given parameters. J. Math. Anal. Appl. 454, 453–467 (2017)MathSciNetCrossRef
22.
Zurück zum Zitat Li, S.C.: Sharp bounds on the eccentric distance sum of graphs. In: Gutman, I., et al. (eds.) Bounds in Chemical Graph Theory–Mainstreams, pp. 207–237. University of Kragujevac, Kragujevac (2017) Li, S.C.: Sharp bounds on the eccentric distance sum of graphs. In: Gutman, I., et al. (eds.) Bounds in Chemical Graph Theory–Mainstreams, pp. 207–237. University of Kragujevac, Kragujevac (2017)
23.
Zurück zum Zitat Li, S.C., Meng, X.: Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications. J. Comb. Optim. 30, 468–488 (2015)MathSciNetCrossRef Li, S.C., Meng, X.: Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications. J. Comb. Optim. 30, 468–488 (2015)MathSciNetCrossRef
24.
Zurück zum Zitat Li, S.C., Song, Y.B.: On the sum of all distances in bipartite graphs. Discrete Appl. Math. 169, 176–185 (2014)MathSciNetCrossRef Li, S.C., Song, Y.B.: On the sum of all distances in bipartite graphs. Discrete Appl. Math. 169, 176–185 (2014)MathSciNetCrossRef
25.
Zurück zum Zitat Li, S.C., Wei, W.: Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications. Discrete Appl. Math. 211, 130–142 (2016)MathSciNetCrossRef Li, S.C., Wei, W.: Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications. Discrete Appl. Math. 211, 130–142 (2016)MathSciNetCrossRef
26.
Zurück zum Zitat Li, S.C., Wu, Y.Y.: On the extreme eccentric distance sum of graphs with some given parameters. Discrete Appl. Math. 206, 90–99 (2016)MathSciNetCrossRef Li, S.C., Wu, Y.Y.: On the extreme eccentric distance sum of graphs with some given parameters. Discrete Appl. Math. 206, 90–99 (2016)MathSciNetCrossRef
27.
Zurück zum Zitat Li, S.C., Zhang, M., Yu, G.H., Feng, L.H.: On the extremal values of the eccentric distance sum of trees. J. Math. Anal. Appl. 390, 99–112 (2012)MathSciNetCrossRef Li, S.C., Zhang, M., Yu, G.H., Feng, L.H.: On the extremal values of the eccentric distance sum of trees. J. Math. Anal. Appl. 390, 99–112 (2012)MathSciNetCrossRef
28.
Zurück zum Zitat Li, S.C., Zhao, L.F.: On the extremal total reciprocal edge-eccentricity of trees. J. Math. Anal. Appl. 433, 587–602 (2016)MathSciNetCrossRef Li, S.C., Zhao, L.F.: On the extremal total reciprocal edge-eccentricity of trees. J. Math. Anal. Appl. 433, 587–602 (2016)MathSciNetCrossRef
29.
Zurück zum Zitat Mantel, W.: Problem 28 (Solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff). Wiskundige Opgaven 10, 60–61 (1907) Mantel, W.: Problem 28 (Solution by H. Gouwentak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W. A. Wythoff). Wiskundige Opgaven 10, 60–61 (1907)
30.
Zurück zum Zitat Sardana, S., Madan, A.K.: Predicting anti-HIV activity of TIBO derivatives: a computational approach using a novel topological descriptor. J. Mol. Model. 8, 258–265 (2002)CrossRef Sardana, S., Madan, A.K.: Predicting anti-HIV activity of TIBO derivatives: a computational approach using a novel topological descriptor. J. Mol. Model. 8, 258–265 (2002)CrossRef
31.
Zurück zum Zitat Sedlar, J.: On augmented eccentric connectivity index of graphs and trees. MATCH Commun. Math. Comput. Chem. 68, 325–342 (2012)MathSciNetMATH Sedlar, J.: On augmented eccentric connectivity index of graphs and trees. MATCH Commun. Math. Comput. Chem. 68, 325–342 (2012)MathSciNetMATH
32.
Zurück zum Zitat 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 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
33.
Zurück zum Zitat Wiener, H.: Structural determination of paraffin boiling point. J. Am. Chem. Soc. 69, 17–20 (1947)CrossRef Wiener, H.: Structural determination of paraffin boiling point. J. Am. Chem. Soc. 69, 17–20 (1947)CrossRef
34.
Zurück zum Zitat Yu, G.H., Feng, L.H.: On the connective eccentricity index of graphs. MATCH Commun. Math. Comput. Chem. 69, 611–628 (2013)MathSciNetMATH Yu, G.H., Feng, L.H.: On the connective eccentricity index of graphs. MATCH Commun. Math. Comput. Chem. 69, 611–628 (2013)MathSciNetMATH
35.
Zurück zum Zitat Yu, G.H., Qu, H., Tang, L., Feng, L.H.: On the connective eccentricity index of trees and unicyclic graphs with given diameter. J. Math. Anal. Appl. 420, 1776–1786 (2014)MathSciNetCrossRef Yu, G.H., Qu, H., Tang, L., Feng, L.H.: On the connective eccentricity index of trees and unicyclic graphs with given diameter. J. Math. Anal. Appl. 420, 1776–1786 (2014)MathSciNetCrossRef
36.
Zurück zum Zitat Wang, G., Yan, L., Zaman, S., Zhang, M.J.: The connective eccentricity index of graphs and its applications to octane isomers and benzenoid hydrocarbons. Int. J. Quantum Chem. 120, e26334 (2020) Wang, G., Yan, L., Zaman, S., Zhang, M.J.: The connective eccentricity index of graphs and its applications to octane isomers and benzenoid hydrocarbons. Int. J. Quantum Chem. 120, e26334 (2020)
Metadaten
Titel
On Connected Graphs Having the Maximum Connective Eccentricity Index
verfasst von
Shahid Zaman
Akbar Ali
Publikationsdatum
07.01.2021
Verlag
Springer Berlin Heidelberg
Erschienen in
Journal of Applied Mathematics and Computing / Ausgabe 1-2/2021
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-020-01489-3

Weitere Artikel der Ausgabe 1-2/2021

Journal of Applied Mathematics and Computing 1-2/2021 Zur Ausgabe