Signed domination in regular graphs

103Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In answer to the open questions proposed by Henning and Slater, we give sharp upper bounds on the upper signed domination number of a regular graph and on the signed domination number of a connected cubic graph.

Cite

CITATION STYLE

APA

Favaron, O. (1996). Signed domination in regular graphs. Discrete Mathematics, 158(1–3), 287–293. https://doi.org/10.1016/0012-365X(96)00026-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free