Research Article

On Comparing Zagreb Indices of Graphs

Volume: 41 Number: 2 February 1, 2012
  • Batmend Horoldagva
  • Kinkar Ch. Das
EN TR

On Comparing Zagreb Indices of Graphs

Abstract

For a (molecular) graph, the first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices, and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs of adjacent vertices. It is well-known that for connected or disconnected graphs, M2/m ≥ M1/n does not hold always. In K. C. Das (On comparing Zagreb indices of graphs, MATCH Commun. Math. Comput. Chem. 63, 433–440, 2010), it has been shown that the above relation holds for a special kind of graph. Here we continue our search for special kinds of graph for which the above relation holds.

Keywords

References

  1. Aouchiche, M., Bonnefoy, J. M., Fidahoussen, A., Caporossi, G., Hansen, P. and Lacher´e, J. A. M. Variable neighborhood search for extremal graphs. 14. The AutoGraphiX 2 system, in: L. Liberti, N. Maculan (Eds.) (Global Optimization: From Theory to Implementation, Springer, 2005).
  2. Balaban, A. T., Motoc, I., Bonchev, D. and Mekenyan, O. Topological indices for structure- activity correlations, in: Steric Effects in Drug Design (M. Charton and I. Motoc, Eds.), Topics Curr. Chem. 114, 21–55, 1983.
  3. Bonchev, D. and Trinajsti´c, N. Overall molecular descriptors 3. Overall Zagreb indices, Sar QSAR Environ. Res. 12, 213–236, 2001.
  4. Caporossi, G. and Hansen, P. Variable neighborhood search for extremal graphs. 1. The AutoGraphiX system, Discrete Math. 212 (1-2), 29–44, 2000.
  5. Caporossi, G. and Hansen, P. Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures, Discrete Math. 276, 81–94, 2004.
  6. Das, K. C. Maximizing the sum of the squares of the degrees of a graph, Discrete Math. 285, –66, 2004.
  7. Das, K. C. On comparing Zagreb indices of graphs, MATCH Commun. Math. Comput. Chem. 63, 433–440, 2010.
  8. Das, K. C. and Gutman, I. Some properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem. 52, 103–112, 2004.

Details

Primary Language

English

Subjects

Statistics

Journal Section

Research Article

Authors

Batmend Horoldagva This is me

Kinkar Ch. Das This is me

Publication Date

February 1, 2012

Submission Date

May 11, 2014

Acceptance Date

-

Published in Issue

Year 2012 Volume: 41 Number: 2

APA
Horoldagva, B., & Das, K. C. (2012). On Comparing Zagreb Indices of Graphs. Hacettepe Journal of Mathematics and Statistics, 41(2), 223-230. https://izlik.org/JA46CY84UX
AMA
1.Horoldagva B, Das KC. On Comparing Zagreb Indices of Graphs. Hacettepe Journal of Mathematics and Statistics. 2012;41(2):223-230. https://izlik.org/JA46CY84UX
Chicago
Horoldagva, Batmend, and Kinkar Ch. Das. 2012. “On Comparing Zagreb Indices of Graphs”. Hacettepe Journal of Mathematics and Statistics 41 (2): 223-30. https://izlik.org/JA46CY84UX.
EndNote
Horoldagva B, Das KC (February 1, 2012) On Comparing Zagreb Indices of Graphs. Hacettepe Journal of Mathematics and Statistics 41 2 223–230.
IEEE
[1]B. Horoldagva and K. C. Das, “On Comparing Zagreb Indices of Graphs”, Hacettepe Journal of Mathematics and Statistics, vol. 41, no. 2, pp. 223–230, Feb. 2012, [Online]. Available: https://izlik.org/JA46CY84UX
ISNAD
Horoldagva, Batmend - Das, Kinkar Ch. “On Comparing Zagreb Indices of Graphs”. Hacettepe Journal of Mathematics and Statistics 41/2 (February 1, 2012): 223-230. https://izlik.org/JA46CY84UX.
JAMA
1.Horoldagva B, Das KC. On Comparing Zagreb Indices of Graphs. Hacettepe Journal of Mathematics and Statistics. 2012;41:223–230.
MLA
Horoldagva, Batmend, and Kinkar Ch. Das. “On Comparing Zagreb Indices of Graphs”. Hacettepe Journal of Mathematics and Statistics, vol. 41, no. 2, Feb. 2012, pp. 223-30, https://izlik.org/JA46CY84UX.
Vancouver
1.Batmend Horoldagva, Kinkar Ch. Das. On Comparing Zagreb Indices of Graphs. Hacettepe Journal of Mathematics and Statistics [Internet]. 2012 Feb. 1;41(2):223-30. Available from: https://izlik.org/JA46CY84UX