General multiplicative Zagreb indices of graphs with given clique number

Tomáš Vetrík; Selvaraj Balachandran

doi:10.7494/OpMath.2019.39.3.433

Opuscula Mathematica (Jan 2019)

General multiplicative Zagreb indices of graphs with given clique number

Tomáš Vetrík,
Selvaraj Balachandran

Affiliations

Tomáš Vetrík: ORCiD; University of the Free State, Department of Mathematics and Applied Mathematics, P.O. Box 339, 9300 Bloemfontein, South Africa
Selvaraj Balachandran: ORCiD; University of the Free State, Department of Mathematics and Applied Mathematics, P.O. Box 339, 9300 Bloemfontein, South Africa

DOI: https://doi.org/10.7494/OpMath.2019.39.3.433
Journal volume & issue: Vol. 39, no. 3
pp. 433 – 446

Abstract

Read online

We obtain lower and upper bounds on general multiplicative Zagreb indices for graphs of given clique number and order. Bounds on the basic multiplicative Zagreb indices and on the multiplicative sum Zagreb index follow from our results. We also determine graphs with the smallest and the largest indices.

Published in Opuscula Mathematica

ISSN: 1232-9274 (Print); 2300-6919 (Online)
Publisher: AGH Univeristy of Science and Technology Press
Country of publisher: Poland
LCC subjects: Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
Website: http://www.opuscula.agh.edu.pl/

About the journal

Abstract

Keywords