On general reduced second Zagreb index of graphs
Abstract
Keywords
References
- [1] B. Bollobás, P. Erdös, and Sarkar, A. Extremal graphs for weights, Discrete Math. 200, 5–19, 1999.
- [2] B. Borovicanin and T.A. Lampert, On the maximum and minimum Zagreb indices of trees with a given number of vertices of maximum degree, MATCH Commun. Math. Comput. Chem. 74, 81–96, 2015.
- [3] G. Caporossi and P. Hansen, Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures, Discrete Math. 276, 81–94, 2004.
- [4] G. Caporossi, P. Hansen, and D. Vukičević, Comparing Zagreb indices of cyclic graphs, MATCH Commun. Math. Comput. Chem. 63, 441–451, 2010.
- [5] S. Chen and W. Liu,Extremal Zagreb indices of graphs with a given number of cut edges, Graphs and Combinatorics 30, 109–118, 2014.
- [6] K.C. Das, Maximizing the sum of the squares of the degrees of a graph, Discrete Math. 285, 57–66, 2004.
- [7] K.C. Das and I. Gutman, Some properties of the second Zagreb index, MATCH Commun. Math. Comput. Chem. 52, 103–112, 2004.
- [8] K.C. Das, I. Gutman, and B. Horoldagva, Comparison between Zagreb indices and Zagreb coindices of trees, MATCH Commun. Math. Comput. Chem. 68, 189–198, 2012.
Details
Primary Language
English
Subjects
Mathematical Sciences
Journal Section
Research Article
Authors
Lkhagva Buyantogtokh
This is me
0000-0002-5685-4879
Publication Date
August 8, 2019
Submission Date
August 10, 2017
Acceptance Date
February 6, 2018
Published in Issue
Year 2019 Volume: 48 Number: 4