The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Let G = (V, E) be a graph and let S ⊆ V.. The set S is a dominating set of G is every vertex of V − S is adjacent to a vertex of S. A vertex v of G is called S-perfect if |N[ν]∩S| = 1 where N[v] denotes the closed neighborhood of v. The set S is defined to be a perfect neighborhood set of G if every vertex of G is S-perfect or adjacent with an S-perfect vertex. We prove that for all graphs G, Θ(G)...
A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A setS V is a dominating set for G if each node in V is dominated by some node in S and is a double dominating set for G if each node in V is dominated by at least two nodes in S. First we give a brief survey of Nordhaus-Gaddum results for several domination-related parameters. Then we present new inequalities...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.