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...
Independent and total domination in antiprism graphs from convex polytopes
Independent and total domination in antiprism graphs from convex polytopes
Let [Formula: see text] be a connected graph. Antiprism graphs, defined as the skeletons of antiprism-shaped convex polytopes, consist of [Formula: see text] vertices and [Formula:...
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...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
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...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...
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 γ...