Keywords and phrases: dominating set, connected total dominating set, neighborhood system, connected total dominating neighborhood polynomial.
Received: January 20, 2023; Accepted: March 30, 2023; Published: May 23, 2023
How to cite this article: Rosalio G. Artes Jr., Rashidin H. Moh. Jiripa and Jeffrey Imer C. Salim, Connected total dominating neighborhood polynomial of graphs, Advances and Applications in Discrete Mathematics 39(2) (2023), 145-154. http://dx.doi.org/10.17654/0974165823042
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] S. Alikhani and Y. Peng, Introduction to domination polynomial of a graph, Ars Combin. 114 (2014), 257-266. [2] R. G. Artes, Jr., M. A. Langamin and A. B. Calib-og, Clique common neighborhood polynomial of graphs, Advances and Applications in Discrete Mathematics 35 (2022), 77-85. [3] J. A. Bondy and U. S. R. Murty, Graph Theory and Related Topics, Academic Press, New York, 1979. [4] J. Brown and R. Nowakowski, The neighborhood polynomial of a graph, Australas. J. Combin. 42 (2008), 55-68. [5] B. Chaluvaraju and V. Chaitra, Total domination polynomial of a graph research article, Journal of Informatics and Mathematical Sciences 6(2) (2014), 87-92. [6] J. Ellis-Monaghan and J. Merino, Graph Polynomials and their Applications II: Interrelations and Interpretations, Birkhauser, Boston, 2011. [7] G. M. Entero and A. C. Pedrano, On connected total domination polynomial of some lexicographical product graphs, Advances and Applications in Discrete Mathematics 27(1) (2021), 147-155. [8] J. L. Gross and J. Yellen, Graph Theory and its Applications, Chapman & Hall, New York, 2006. [9] I. Gutman, Graphs and graph polynomials of interest in chemistry, Gottfried Tinhofer and Gunther Schmidt, eds., Lecture Notes in Computer Science, Springer-Verlag, Berlin, 2005, pp. 177-187. [10] F. Harary, Graph Theory, CRC Press, Boca Raton, 2018.
|