Let  be a simple undirected graph of order n,  be the family of vertex cuts with cardinality i and  Then the vertex cut polynomial of G is defined as

In this paper, we focus on vertex cut polynomials of some unary graph operations.

vertex connectivity, vertex cut polynomial.

Received: August 5, 2022; Revised: January 18, 2023; Accepted: January 31, 2023; Published: February 6, 2023

How to cite this article: K. Safeera and V. Anil Kumar, Vertex cut polynomials of some unary graph operations, Advances and Applications in Discrete Mathematics 37 (2023), 95-103. http://dx.doi.org/10.17654/0974165823014

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:

[1] 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.
[2] K. Safeera and V. Anil Kumar, Complement degree polynomials of some graph operations, Palestine Journal of Mathematics (communicated).
[3] M. Shikhi, A study on common neighbor polynomial of graphs, Ph. D. Thesis, Calicut University, 2019.
[4] F. Harary, Graph Theory, Addison-Wesley, 1969.