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...
Main Authors: | D.A. Mojdeh, M. Ghanbari, M. Ramezani |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2017-09-01
|
Series: | ICT Express |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2405959516301308 |
Similar Items
-
Some results on the independence number of connected domination critical graphs
by: P. Kaemawichanurat, et al.
Published: (2018-08-01) -
Independent set dominating sets in bipartite graphs
by: Bohdan Zelinka
Published: (2005-01-01) -
Bounds on the 2-domination number in cactus graphs
by: Mustapha Chellali
Published: (2006-01-01) -
Computation of Various Domination Numbers of Rolf Nevanlinna (RNP) Collaboration Graph
by: Yegnanarayanan V, et al.
Published: (2017-08-01) -
On equality in an upper bound for the acyclic domination number
by: Vladimir Samodivkin
Published: (2008-01-01)