New bound on MIS and MIN-CDS for a unit ball graph | Zendy

Doost Ali Mojdeh | Zendy; M. Ghanbari | Zendy; Mehdi Ramezani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

New bound on MIS and MIN-CDS for a unit ball graph

Author(s) -

Doost Ali Mojdeh,

M. Ghanbari,

Mehdi Ramezani

Publication year - 2017

Publication title -

ict express

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.733

H-Index - 22

ISSN - 2405-9595

DOI - 10.1016/j.icte.2017.04.003

Subject(s) - upper and lower bounds , mathematics , combinatorics , independence number , graph , dominating set , domination analysis , independence (probability theory) , unit sphere , ball (mathematics) , discrete mathematics , statistics , geometry , vertex (graph theory) , mathematical analysis

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research