Abstract
LetG = (V, E) be a graph. The functionf : V(G) → {−1, 1} is a signed dominating function if for every vertexv ∈ V(G), ∑x∈NG[v]f(x)≥1. The value ofω(f) = ∑x∈V(G)f(x) is called the weight off. The signed domination number ofGis the minimum weight of a signed dominating function ofG. In this paper, we initiate the study of the signed domination numbers of Mycielski graphs and find some upper bounds for this parameter. We also calculate the signed domination number of the Mycielski graph when the underlying graph is a star, a wheel, a fan, a Dutch windmill, a cycle, a path or a complete bipartite graph.
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.
