Sum of Domination and Independence Numbers of Cubic Bipartite Graphs

Authors

Rekha Lahoti
Pacific University

Omprakash Prakash Sikhwal

Sapna Shrimali

Abstract

The fastest growing area within graph theory is the study of domination and Independence numbers, the reason being its many and varied applications in such fields as social sciences, communications networks, algorithmic designs etc. A subset D of V is a dominating set of G if every vertex of V- D is adjacent to a vertex of D. The domination number of G, denoted by Î³ (G), is the minimum cardinality of a dominating set of G. Domination number is the cardinality of a minimum dominating set of a graph. Independence number is the maximal cardinality of an independent set of vertices of a graph. In this paper we present results on domination and independence numbers of cubic bipartite graphs.