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: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2017-09-01
|
| Series: | ICT Express |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2405959516301308 |
| id |
doaj-509d8431904f4220b219132433c12710 |
|---|---|
| record_format |
Article |
| spelling |
doaj-509d8431904f4220b219132433c127102020-11-24T21:11:23ZengElsevierICT Express2405-95952017-09-013311511810.1016/j.icte.2017.04.003New bound on MIS and MIN-CDS for a unit ball graphD.A. Mojdeh0M. Ghanbari1M. Ramezani2Department of Mathematics, University of Mazandaran, Babolsar, IranDepartment of Mathematics, University of Tafresh, Tafresh, IranDepartment of Mathematics, University of Tafresh, Tafresh, IranThe 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.http://www.sciencedirect.com/science/article/pii/S2405959516301308Connected dominating setIndependence numberUnit ball graph |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
D.A. Mojdeh M. Ghanbari M. Ramezani |
| spellingShingle |
D.A. Mojdeh M. Ghanbari M. Ramezani New bound on MIS and MIN-CDS for a unit ball graph ICT Express Connected dominating set Independence number Unit ball graph |
| author_facet |
D.A. Mojdeh M. Ghanbari M. Ramezani |
| author_sort |
D.A. Mojdeh |
| title |
New bound on MIS and MIN-CDS for a unit ball graph |
| title_short |
New bound on MIS and MIN-CDS for a unit ball graph |
| title_full |
New bound on MIS and MIN-CDS for a unit ball graph |
| title_fullStr |
New bound on MIS and MIN-CDS for a unit ball graph |
| title_full_unstemmed |
New bound on MIS and MIN-CDS for a unit ball graph |
| title_sort |
new bound on mis and min-cds for a unit ball graph |
| publisher |
Elsevier |
| series |
ICT Express |
| issn |
2405-9595 |
| publishDate |
2017-09-01 |
| description |
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. |
| topic |
Connected dominating set Independence number Unit ball graph |
| url |
http://www.sciencedirect.com/science/article/pii/S2405959516301308 |
| work_keys_str_mv |
AT damojdeh newboundonmisandmincdsforaunitballgraph AT mghanbari newboundonmisandmincdsforaunitballgraph AT mramezani newboundonmisandmincdsforaunitballgraph |
| _version_ |
1716753585720524800 |