Keywords and phrases: geodetic set, dominating set, neighborhood system, geodetic subdominating neighborhood polynomial.
Received: January 18, 2023; Accepted: March 30, 2023; Published: April 18, 2023
How to cite this article: Rosalio G. Artes, Jr. and Josephine B. Nalzaro, Combinatorial approach for counting geodetic sets with subdominating neighborhood systems, Advances and Applications in Discrete Mathematics 38(2) (2023), 179-189. http://dx.doi.org/10.17654/0974165823027
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. Brown and R. Nowakowski, The neighborhood polynomial of a graph, Australas. J. Combin. 42 (2008), 55-68. [4] J. Ellis-Monaghan and J. Merino, Graph Polynomials and their Applications II: Interrelations and Interpretations, Birkhauser, Boston, 2011. [5] 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. [6] F. Harary, Graph Theory, CRC Press, Boca Raton, 2018. [7] U. S. R. Murty and J. A. Bondy, Graph Theory and Related Topics, Academic Press, New York, 1979. [8] J. Yellen and J. L. Gross, Graph Theory and its Applications, Chapman & Hall, New York, 2006. [9] A. Vijayan and K. Vijila Dafini, On geodetic sets and geodetic polynomials of wheels and paths, Int. J. Math. Sci. Eng. Appl. 6(3) (2012), 123-137. |