Isolated Domination Polynomial of a Graph


Abstract views: 56 / PDF downloads: 51

Authors

  • Puttaswamy Department of Mathematics, PES College of Engineering, Mandya, Karnataka, India
  • M. N. Prakasha Department of Mathematics, PES College of Engineering, Mandya, Karnataka, India
  • S. R. Nayaka Department of Mathematics, PES College of Engineering, Mandya, Karnataka, India

Keywords:

Dominating set, Isolated dominating set, Domination polynomial, isolated domination polynomial of a graph

Abstract

A dominating set $ S$ of a graph $ G$ is called an isolated dominating set, if $\langle S\rangle $ contains at least one isolated vertex. The minimum cardinality of an isolated dominating set is called the isolated domination number, symbolized by $\gamma_o(G)$. In this paper, we initiate the study of a graph polynomial called isolated domination polynomial. We determine the isolated domination polynomial of some standard graphs and characterize some class of graphs through the isolated domination polynomial. Finally, we determine the isolated domination polynomial at some particular values.

Downloads

Published

15-12-2020

How to Cite

Puttaswamy, M. N. Prakasha, & S. R. Nayaka. (2020). Isolated Domination Polynomial of a Graph. International Journal of Mathematics And Its Applications, 8(4), 69–73. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/120

Issue

Vol. 8 No. 4 (2020)

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)