| Summary: | The study of the maximum and minimal characteristics of graphs is the focus of the significant field of mathematics known as extreme graph theory. Finding the biggest or smallest graphs that meet specified criteria is the main goal of this discipline. There are several applications of extremal graph theory in various fields, including computer science, physics, and chemistry. Some of the important applications include: Computer networking, social networking, chemistry and physics as well. Recently, in 2021 exponential multiplicative Zagreb indices were introduced. In generalization, we introduce the generalized form of exponential multiplicative Zagreb indices for <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi><mo>∈</mo><msup><mi mathvariant="double-struck">R</mi><mo>+</mo></msup><mo>\</mo><mrow><mo>{</mo><mn>1</mn><mo>}</mo></mrow><mo>.</mo></mrow></semantics></math></inline-formula> Furthermore, to see the behaviour of generalized first and second exponential Zagreb indices for <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>α</mi><mo>∈</mo><msup><mi mathvariant="double-struck">R</mi><mo>+</mo></msup><mo>\</mo><mrow><mo>{</mo><mn>1</mn><mo>}</mo></mrow><mo>,</mo></mrow></semantics></math></inline-formula> we used a transformation method. In term of the two newly developed generalized exponential multiplicative Zagreb indices, we will investigate the extremal bicyclic, uni-cyclic and trees graphs. Four graph transformations are used and some bounds are presented in terms of generalized exponential multiplicative Zagreb indices.
|
|---|