ScholarLens Back to search
2022•AIP conference proceedingsRequires access

Inverse whole domination in graphs

Ahmed Abed Ali Omran, Thaer A. Ibrahim

Open publisher page 0 citations

Abstract

We consider a graph G =(V, E) as a simple, finite and undirected with vertex set V(G) and edge set E(G). Through this work, the study of the new concept “inverse whole domination” in a graph with some bounds and some exact values for γ−1wh(G), are presented. Also, some relationships between the inverse whole domination and other domination parameters are established. The changing and unchanging by deleting or adding an edge or deleting a vertex is discussed of this definition.

About this research paper

What this paper is about

We consider a graph G =(V, E) as a simple, finite and undirected with vertex set V(G) and edge set E(G). Through this work, the study of the new concept “inverse whole domination” in a graph with some bounds and some exact values for γ−1wh(G), are presented. Also, some relationships between the inverse whole domination and other domination parameters are established. The changing and unchanging by deleting or adding an edge or deleting a vertex is discussed of this definition.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We consider a graph G =(V, E) as a simple, finite and undirected with vertex set V(G) and edge set E(G). Through this work, the study of the new concept “inverse whole domination” in a graph with some bounds and some exact values for γ−1wh(G), are presented. Also, some relationships between the inverse whole domination and other domination parameters are established. The changing and unchanging by deleting or adding an edge or deleting a vertex is discussed of this definition.

Key concepts: Inverse, Vertex (graph theory), Undirected graph, Combinatorics, Graph, Mathematics, Simple graph, Enhanced Data Rates for GSM Evolution

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
Inverse whole domination in graphs — Research Paper | ScholarLens