New bound on MIS and MIN-CDS for a unit ball graph
The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number. The aim of this paper is to determine two better upper bounds of the independence number; dependent...
Gespeichert in:
Veröffentlicht in: | ICT express 2017, 3(3), , pp.115-118 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The size of the maximum independent set (MIS) in a graph G is called the independence number. The size of the minimum connected dominating set (MIN-CDS) in G is called the connected domination number. The aim of this paper is to determine two better upper bounds of the independence number; dependent on the connected domination number for a unit ball graph. Further, we improve the upper bound to obtain the best bound with respect to the upper bounds obtained thus far. |
---|---|
ISSN: | 2405-9595 2405-9595 |
DOI: | 10.1016/j.icte.2017.04.003 |