Superior Eccentric Domination Polynomial

Authors

  • R Tejaskumar (Jamal Mohamed College (Affiliated to Bharathidasan University), Tiruchirappalli)
  • A Mohamed Ismayil (Jamal Mohamed College (Affiliated to Bharathidasan University), Tiruchirappalli)

DOI:

https://doi.org/10.23755/rm.v46i0.1082

Keywords:

Superior distance, superior eccentricity, superior eccentric domination polynomial

Abstract

In this paper we introduce the superior eccentric domination polynomial $SED(G, φ) = β\sum_{ l=\gamma_{sed}(G)} |sed(G, l)|φ^{l}$ where |sed(G, l)| is the number of all distinct superior eccentric dominating sets with cardinality l and $\gamma_{sed}(G)$ is superior eccentric domination number. We find SED(G, φ) for different standard graphs. Results are presented.

Per leggere l'articolo completo, accedi con un abbonamento attivo. (To read the full article, log in with an active subscription.)

Accedi · Log in · Abbonamenti · Subscriptions

References

S. Alikhani and Y.-h. Peng. Introduction to domination polynomial of a graph. arXiv preprint arXiv:0905.2251, 2009.

M. Bhanumathi and R. M. Abirami. Superior eccentric domination in graphs. International Journal of Pure and Applied Mathematics, 117(14):175–182, 2017.

F. Harary. Graph theory. Narosa Publishing House, New Delhi, 2001.

A. M. Ismayil and R. Tejaskumar. Eccentric domination polynomial of graphs.Advances in Mathematics: Scientific Journal, 9(4):1729–1739, 2020.

K. Kathiresan and G. Marimuthu. Superior domination in graphs. Utilitas Mathematica, 76:173, 2008.

K. Kathiresan, G. Marimuthu, and W. Sivakasi. Superior distance in graphs. Journal of combinatorial mathematics and combinatorial computing, 61:73, 2007

Published

2023-03-20