Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
DOMINATION NIRMALA INDICES OF GRAPHS
View through CrossRef
In this study, we introduce the domination Nirmala index, modified domination Nirmala index and their corresponding exponentials of a graph.Furthermore, we compute these domination Nirmala indices for some standard graphs, windmill graphs, book graphs.
Title: DOMINATION NIRMALA INDICES OF GRAPHS
Description:
In this study, we introduce the domination Nirmala index, modified domination Nirmala index and their corresponding exponentials of a graph.
Furthermore, we compute these domination Nirmala indices for some standard graphs, windmill graphs, book graphs.
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...
NIRMALA ALPHA GOURAVA AND MODIFIED NIRMALA ALPHA GOURAVA INDICES OF CERTAIN DENDRIMERS
NIRMALA ALPHA GOURAVA AND MODIFIED NIRMALA ALPHA GOURAVA INDICES OF CERTAIN DENDRIMERS
In this paper, we introduce the Nirmala alpha Gourava and modified Nirmala alpha Gourava indices and their corresponding exponentials of a graph. Also we compute the Nirmala alpha ...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Domination-related colorings of n-inordinate invariant intersection graphs
Domination-related colorings of n-inordinate invariant intersection graphs
Algebraic graph theory is an intriguing field of research in which various properties of graphs constructed based on algebraic structures are studied. Interlacing two important str...
Introducing 3-Path Domination in Graphs
Introducing 3-Path Domination in Graphs
The dominating set of a graph G is a set of vertices D such that for every v ∈ V ( G ) either v ∈ D or v is adjacent to a vertex in D . The domination number, denoted γ...
Locating fair domination in graphs
Locating fair domination in graphs
Graphs considered here are simple, finite and undirected. A graph is denoted by [Formula: see text] and its vertex set by [Formula: see text] and edge set by [Formula: see text]. M...
On Multiplicative Inverse of Nirmala Indices
On Multiplicative Inverse of Nirmala Indices
Recently, a novel degree based topological index was introduced, so called the Nirmala index. In this study, we introduce the multiplicative Nirmala index, the multiplicative first...