Signed 2-independence in graphs

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


A function f:F→ {-1,1} defined on the vertices of a graph G = (V,E) is a signed 2-independence function if the sum of its function values over any closed neighbourhood is at most one. That is, for every i>6 V, f(N[v]) < 1, where N[v] consists of v and every vertex adjacent to i>. The weight of a signed 2-independence function is f(V) -42f(u), over all vertices v £V. The signed 2-independence number of a graph G, denoted cCj(G), equals the maximum weight of a signed 2-independence function of G. In this paper, we establish upper i bounds for «j(G) in terms of the order and size of the graph, and we characterize the graphs attaining these bounds. For a tree T, upper and lower bounds for a](T) are established and the extremal graphs characterized. It is shown that a}(G) can be arbitrarily large negative even for a cubic graph G. ©2002 Eisevier Science B.V. All rights reserved.




Henning, M. A. (2002). Signed 2-independence in graphs. Discrete Mathematics, 250(1–3), 93–107.

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