Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A signed dominating function of a graph G with vertex set V is a function f : V →{ −1, 1} such that for every vertex v in V the sum of the values of f at v and at every vertex u adjacent to v is at least 1. The ight of f is the sum of the values of f at every vertex of V . The signed domination number of G is the minimum ight of a signed dominating function of G. ,  study the signed domination numbers of graphs and present new sharp lor and upper bounds for this parameter. As an example,  prove that the signed domination number of a tree of order ∗
['S.M. Hosseini Moghaddam', 'Abdollah Khodkar', 'Babak Samadi']
I am writing a research paper on a idea New bounds on the signed domination numbers of graphs
[{"from": "human", "value": "I am writing a research paper on a idea New bounds on the signed domination numbers of graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A signed dominating function of a graph G with vertex set V is a function f : V \u2192{ \u22121, 1} such that for every vertex v in V the sum of the values of f at v and at every vertex u adjacent to v is at least 1. The ight of f is the sum of the values of f at every vertex of V . The signed domination number of G is the minimum ight of a signed dominating function of G. ,  study the signed domination numbers of graphs and present new sharp lor and upper bounds for this parameter. As an example,  prove that the signed domination number of a tree of order \u2217"}]