Bounds on the Signed 2-Independence Number in Graphs
Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G. The weight of a signed 2-independence function f is w(f)...
Main Author: | Volkmann Lutz |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2013-09-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1686 |
Similar Items
-
Signed k-independence in graphs
by: Volkmann Lutz
Published: (2014-03-01) -
An Improved Nordhaus–Gaddum-Type Theorem for 2-Rainbow Independent Domination Number
by: Enqiang Zhu
Published: (2021-02-01) -
Remarks on the outer-independent double Italian domination number
by: Lutz Volkmann
Published: (2021-03-01) -
Some Sharp Bounds on the Negative Decision Number of Graphs
by: Liang Hongyu
Published: (2013-09-01) -
On the signed $2$-independence number of graphs
by: S.M. Hosseini Moghaddam, et al.
Published: (2017-04-01)