On the Signed (Total) K-Independence Number in Graphs
Let G be a graph. A function f : V (G) → {−1, 1} is a signed k- independence function if the sum of its function values over any closed neighborhood is at most k − 1, where k ≥ 2. The signed k-independence number of G is the maximum weight of a signed k-independence function of G. Similarly, the sig...
Main Authors: | Khodkar Abdollah, Samadi Babak, Volkmann Lutz |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-11-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1824 |
Similar Items
-
On the signed $2$-independence number of graphs
by: S.M. Hosseini Moghaddam, et al.
Published: (2017-04-01) -
New Bounds on the Signed Total Domination Number of Graphs
by: Moghaddam Seyyed Mehdi Hosseini, et al.
Published: (2016-05-01) -
On the inverse signed total domination number in graphs
by: D. A. Mojdeh, et al.
Published: (2017-01-01) -
Upper Bounds on the Signed Total (K, K)-Domatic Number of Graphs
by: Volkmann Lutz
Published: (2015-11-01) -
On the Total k-Domination in Graphs
by: Bermudo Sergio, et al.
Published: (2018-02-01)