Abstract
Let G = (V, E) be a simple Graph. A set S V(G) is a vertex-edge dominating set (or simply ve-dominating set) if for all edges e E(G), there exist a vertex v S such that v dominates e. In this paper, we study the concept of vertex-edge domination polynomial of the cycle Cn. The vertex-edge domination polynomial of Cn is Dve(Cn, x) = |V(G)|
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
