Keywords and phrases: graph polynomials, vertex connectivity of a graph, vertex cut polynomials.
Received: January 28, 2022; Accepted: April 30, 2022; Published: June 1, 2022
How to cite this article: K. Safeera and V. Anil Kumar, Vertex cut polynomial of graphs, Advances and Applications in Discrete Mathematics 32 (2022), 1-12. http://dx.doi.org/10.17654/0974165822028
References:
[1] M. Shikhi and V. Anil Kumar, Common neighbor polynomial of graphs, Far East J. Math. Sci. (FJMS) 102(6) (2017), 1201-1221. [2] F. Harary, Graph Theory, Addison-Wesley, 1969. [3] M. P. Shyama and V. Anil Kumar, Total domination polynomials of complete partite graphs, Advances and Applications in Discrete Mathematics 13(1) (2014), 23-28. [4] M. P. Shyama and V. Anil Kumar, On the roots of Hosoya polynomial, J. Discrete Math. Sci. Cryptogr. 19 (2016), 199-219. [5] S. Alikhani, Dominating sets and domination polynomials of graphs, Ph.D. Thesis, 2009.
|