Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Independent Domination Number of Operation Graph
View through CrossRef
Let G be a simple, undirected and connected graph. An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every vertex u ∈ V (G) − D is adjacent to some vertex v ∈ D. A set S of vertices in 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. A minimum independent dominating set is an independent set of smallest possible size for a given graph G. This size is called the independence number of G, and denoted i(G). Operation Graph is a technical to get a new graph types by performing the operation of two or more graphs. Power Graph is a operation graph where let the graph G and H , notation of the power graph is (GH ). Keywords: r-dynamic coloring, r-dynamic chromatic number, graph operations.
FKIP The University of Jember
Title: Independent Domination Number of Operation Graph
Description:
Let G be a simple, undirected and connected graph.
An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent.
A set D of vertices of graph G is called a dominating set if every vertex u ∈ V (G) − D is adjacent to some vertex v ∈ D.
A set S of vertices in 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.
A minimum independent dominating set is an independent set of smallest possible size for a given graph G.
This size is called the independence number of G, and denoted i(G).
Operation Graph is a technical to get a new graph types by performing the operation of two or more graphs.
Power Graph is a operation graph where let the graph G and H , notation of the power graph is (GH ).
Keywords: r-dynamic coloring, r-dynamic chromatic number, graph operations.
.
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Domination of polynomial with application
Domination of polynomial with application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Determination and Analysis of Domination Numbers for Boundary Graph and Boundary Neighbour Graph Using MATLAB
Determination and Analysis of Domination Numbers for Boundary Graph and Boundary Neighbour Graph Using MATLAB
Vertex domination is a key concept in graph theory, essential for analyzing the structural properties of graphs. This study explores the use of vertex domination to determine the d...
Fractional Domination Game
Fractional Domination Game
Given a graph $G$, a real-valued function $f: V(G) \rightarrow [0,1]$ is a fractional dominating function if $\sum_{u \in N[v]} f(u) \ge 1$ holds for every vertex $v$ and its close...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...
The Complexity of Pencil Graph and Line Pencil Graph
The Complexity of Pencil Graph and Line Pencil Graph
Let ???? be a linked and undirected graph. Every linked graph ???? must contain a spanning tree ????, which is a subgraph of ????that is a tree and contain all the nodes of ????. T...
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap
The locating coloring of graph extends the vertex coloring dan partition dimension of graph. The minimum number of locating coloring of graph G is called the locating chromatic num...