Graphs with equal domination and independent domination number

A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set of G. In this paper, some new...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 5; no. 1; pp. 74 - 79
Main Authors Vaidya, S.K, Pandit, R.M
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.01.2015
Elman Hasanoglu
Subjects
Graph theory
Graphs
Mathematical analysis
Mathematical research
Number theory
Theoretical mathematics
Online AccessGet full text
ISSN2146-1147
2146-1147

Cover

More Information
Summary:A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set of G. In this paper, some new classes of graphs with equal domination and independent domination numbers are presented and exact values of their domination and independent domination numbers are determined.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:2146-1147
2146-1147