On the signed $2$-independence number of graphs
In this paper, we study the signed 2-independence number in graphs and give new sharp upper and lower bounds on the signed 2-independence number of a graph by a simple uniform approach. In this way, we can improve and generalize some known results in this area.
Сохранить в:
Главные авторы: | , , , |
---|---|
Формат: | EJournal Article |
Опубликовано: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-04-10.
|
Предметы: | |
Online-ссылка: | Get Fulltext |
Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
Internet
Get Fulltext3rd Floor Main Library
Шифр: |
A1234.567 |
---|---|
Копировать 1 | Доступно |