Abstract
Let G=(V, E) be a simple graph. A set S ⊆ V is called a dominating set if every vertex v ∈ V is either a member of S or adjacent to a member of S. A set S ⊆ V is a Strong dominating set of G if for every vertex v ∈ V − S there exists a u ∈ S such that uv ∈ E and deg(u) ≥ deg(v). Let Fln be a Flower graph which is obtained from helm graph by joining each pendant vertex to the central vertex. Let Sd(Flnj) be the family of strong dominating set of Flower graph with number of elements in the set j and let Sd(Fln,j)= |Sd(Flnj)|. In this paper we establish Fln and obtain a iterative formula for Sd(Flnj). Using this iterative formula we consider the polynomial for SD(Fln,x)=∑j=02n(2nj) xj+1. Also we have determine several properties of polynomials on Flower graphs.
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.
