INDEPENDENT DOMINATION NUMBER OF GRAPHS THROUGH VERTEX SWITCHING

Let G = (V, E) be a graph with vertex set V and edge set E. An independent dominating set S of G is a subset of V with the property that every vertex in V - S is adjacent to some vertex in S and no two vertices within S are adjacent. The number of vertices in a minimum independent dominating set in...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 14; no. 2; p. 508
Main Authors Parveen, S. Thilsath, Balamurugan, B.J
Format Journal Article
LanguageEnglish
Published Turkic World Mathematical Society 01.04.2024
Subjects
Social networks
India
Online AccessGet full text
ISSN2146-1147

Cover

More Information
Summary:Let G = (V, E) be a graph with vertex set V and edge set E. An independent dominating set S of G is a subset of V with the property that every vertex in V - S is adjacent to some vertex in S and no two vertices within S are adjacent. The number of vertices in a minimum independent dominating set in the graph G is called the independent domination number i(G) of G. In this article, the independent domination number of graphs obtained through vertex switching have been computed with appropriate illustration. Keywords: Graphs, independent domination, independent dominating set, independent domination number, vertex switching. AMS Subject Classification: 05C69, 05C76.
ISSN:2146-1147