Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Computing the Energy of Certain Graphs based on Vertex Status

View through CrossRef
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 aim is to explore the graph energy of various graph families on the base of the status adjacency matrix and its Laplacian version. Methods: We opt for the technique of finding eigenvalues of adjacency and Laplacian matrices constructed on the base of the status of vertices. Results: We explore the exact status sum and Laplacian status sum energies of a complete graph, complete bipartite graph, star graphs, bistar graphs, barbell graphs and graphs of two thorny rings. We also compared the obtained results of energy numerically and graphically. Conclusion: In this article, we extended the study of graph spectrum and energy by introducing the new concept of the status sum adjacency matrix and the Laplacian status sum adjacency matrix of a graph. We investigated and visualized these newly defined spectrums and energies of well-known graphs, such as complete graphs, complete bi-graphs, star graphs, friendship graphs, bistar graphs, barbell graphs, and thorny graphs with 3 and 4 cycles.
Title: Computing the Energy of Certain Graphs based on Vertex Status
Description:
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 aim is to explore the graph energy of various graph families on the base of the status adjacency matrix and its Laplacian version.
Methods: We opt for the technique of finding eigenvalues of adjacency and Laplacian matrices constructed on the base of the status of vertices.
Results: We explore the exact status sum and Laplacian status sum energies of a complete graph, complete bipartite graph, star graphs, bistar graphs, barbell graphs and graphs of two thorny rings.
We also compared the obtained results of energy numerically and graphically.
Conclusion: In this article, we extended the study of graph spectrum and energy by introducing the new concept of the status sum adjacency matrix and the Laplacian status sum adjacency matrix of a graph.
We investigated and visualized these newly defined spectrums and energies of well-known graphs, such as complete graphs, complete bi-graphs, star graphs, friendship graphs, bistar graphs, barbell graphs, and thorny graphs with 3 and 4 cycles.

Related Results

Differential graded vertex Lie algebras
Differential graded vertex Lie algebras
This is the continuation of the study of differential graded (dg) vertex algebras defined in our previous paper [Caradot et al., “Differential graded vertex operator algebras and t...
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
THE FORCING EDGE FIXING EDGE-TO-VERTEX MONOPHONIC NUMBER OF A GRAPH
For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e –...
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. ...
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
BILANGAN KROMATIK EQUITABLE PADA GRAF BINTANG, GRAF LOLIPOP, DAN GRAF PERSAHABATAN
Let G be a connected and undirected graph. Vertex coloring in a graph G is a mapping from the set of vertices in G to the set of colors such that every two adjacent vertices have d...
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...
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 ...
The Vertex-Edge Locating Roman Domination of Some Graphs
The Vertex-Edge Locating Roman Domination of Some Graphs
In this paper, we introduce the concept of vertex-edge locating Roman dominating functions in graphs. A vertex-edge locating Roman dominating (\({ve} - {LRD}\)) function of a graph...
The Vertex-Edge Locating Roman Domination of Some Graphs
The Vertex-Edge Locating Roman Domination of Some Graphs
In this paper, we introduce the concept of vertex-edge locating Roman dominating functions in graphs. A vertex-edge locating Roman dominating (\(ve-LRD\)) function of a graph \(G=(...

Back to Top