Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
The Minimum Superior Dominating Energy of Graphs
View through CrossRef
Kathiresan and Marimuthu were the pioneers of superior distance in graphs. The same authors put forth the concept of superior domination in 2008. Superior distance is the shortest walk between any two vertices including their respective neighbours. The minimum superior dominating energy is defined by the sum of the eigenvalues and it is obtained from the minimum superior dominating matrix . The minimum superior dominating energy for star and crown graphs are computed. Properties of eigenvalues of minimum superior dominating matrix for star, cocktail party, complete and crown graphs are discussed. Results related to upper and lower bounds of minimum superior dominating energy for star, cocktail party, complete and crown graphs are stated and proved.
Sciencedomain International
Title: The Minimum Superior Dominating Energy of Graphs
Description:
Kathiresan and Marimuthu were the pioneers of superior distance in graphs.
The same authors put forth the concept of superior domination in 2008.
Superior distance is the shortest walk between any two vertices including their respective neighbours.
The minimum superior dominating energy is defined by the sum of the eigenvalues and it is obtained from the minimum superior dominating matrix .
The minimum superior dominating energy for star and crown graphs are computed.
Properties of eigenvalues of minimum superior dominating matrix for star, cocktail party, complete and crown graphs are discussed.
Results related to upper and lower bounds of minimum superior dominating energy for star, cocktail party, complete and crown graphs are stated and proved.
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...
New results on connected dominating structures in graphs
New results on connected dominating structures in graphs
Abstract
A set of vertices in a graph is a dominating set if every vertex not in the set is adjacent to at least one vertex in the set. A dominating structure is a s...
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...
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...
Conditions of Safe Dominating Set in Some Graph Families
Conditions of Safe Dominating Set in Some Graph Families
Let X be an arbitrary Banach space. For a nontrivial connected graph G and nonempty subset S \(\subseteq\) V (G), S is a safe dominating set of G if and only if S is a dominating s...
Introducing Optimal Energy Hub Approach in Smart Green Ports based on Machine Learning Methodology
Introducing Optimal Energy Hub Approach in Smart Green Ports based on Machine Learning Methodology
Abstract
The integration of renewable energy systems in port facilities is essential for achieving sustainable and environmentally friendly operations. This paper presents ...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Abstract
Three classes of pendent vertex- and pendant edge-weighted graphs of linear chains (class I), stars (class II), and cycles (class III) have been presented. ...