CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS
In this paper, we introduce the concept of connected dominating independent neighborhood polynomial of a graph and obtain the same for some classes of graphs.
connected dominating set, independent set, connected dominating independent neighborhood polynomial.
Received: March 10, 2023; Accepted: April 22, 2023; Published: May 13, 2023
How to cite this article: Roxanne A. Anunciado and Rosalio G. Artes, Jr., Connected dominating independent neighborhood polynomial of graphs, Advances and Applications in Discrete Mathematics 39(1) (2023), 73-80. http://dx.doi.org/10.17654/0974165823036
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] N. Abdulcarim, S. Dagondon and E. Chacon, On the independent neighborhood polynomial of the Cartesian product of some special graphs, European Journal of Pure and Applied Mathematics 14(1) (2021), 173-191.[2] S. Alikhani and Y. Peng, Introduction to domination polynomial of a graph, Ars Combin. 114 (2014), 257-266.[3] 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.[4] J. A. Bondy and U. S. R. Murty, Graph Theory and Related Topics, Academic Press, New York, 1979.[5] J. Brown and R. Nowakowski, The neighborhood polynomial of a graph, Australas. J. Combin. 42 (2008), 55-68.[6] J. Ellis-Monaghan and J. Merino, Graph Polynomials and their Applications II: Interrelations and Interpretations, Birkhauser, Boston, 2011.[7] J. L. Gross and J. Yellen, Graph Theory and its Applications, Chapman & Hall, New York, 2006.[8] I. Gutman, Graphs and graph polynomials of interest in chemistry, Gottfried Tinhofer and Gunther Schmidt, ed., Lecture Notes in Computer Science, Berlin, Springer-Verlag, 2005, pp. 177-187.[9] F. Harary and T. Haynes, Double domination in graphs, Ars Combin. 55 (2000), 201-213.[10] C. Hoede and X. Li, Clique polynomials and independent set polynomials of graphs, Discrete Math. 125 (1994), 219-228.[11] A. Vijayan and M. Felix Nes Mabel, Connected domination polynomial of some graphs, IOSR Journal of Mathematics 12(III) (2016), 13-16.
