On The Second Domination Hyper Polynomial of Graphs


Abstract views: 57 / PDF downloads: 92

Authors

  • S. Raju Department of Mathematics, P.E.S.College of Engineering (University of Mysore), Mandya, Karnataka, India
  • Puttaswamy Department of Mathematics, P.E.S.College of Engineering (University of Mysore), Mandya, Karnataka, India
  • S. R. Nayaka Department of Mathematics, P.E.S.College of Engineering (University of Mysore), Mandya, Karnataka, India

Keywords:

Second domination hyper index, Domination degree, Minimal domination set, Second domination hyper polynomial

Abstract

Graph polynomials are powerful and well-developed tools to express graph parameters. A chemical graph can be recognized by a numerical number (topological index), algebraic polynomial, or any matrix. These numbers and polynomials help to predict many physicochemical properties of underline chemical compounds. In this paper, we define a new version of domination polynomials known as the second domination hyper polynomial. Also, we will study and calculate this new polynomial for some graph families. Also, we calculate the second domination hyper polynomials with its plotting for Hexane isomers.

 

Author Biographies

S. Raju, Department of Mathematics, P.E.S.College of Engineering (University of Mysore), Mandya, Karnataka, India

 

 

Puttaswamy, Department of Mathematics, P.E.S.College of Engineering (University of Mysore), Mandya, Karnataka, India

 

 

S. R. Nayaka, Department of Mathematics, P.E.S.College of Engineering (University of Mysore), Mandya, Karnataka, India

 

 

Downloads

Published

27-03-2023

How to Cite

S. Raju, Puttaswamy, & S. R. Nayaka. (2023). On The Second Domination Hyper Polynomial of Graphs. International Journal of Mathematics And Its Applications, 11(1), 113–124. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/948

Issue

Vol. 11 No. 1 (2023)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Most read articles by the same author(s)