Javascript must be enabled to continue!
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
View through CrossRef
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. These graphs (particularly class I and III) represent heteroconjugated π-systems. Sometimes such graphs appear as factored subgraphs of some complicated graphs. The eigenspectra of these graphs have been found out in analytical forms. These eigenspectra have been utilized i) to calculate the band (i.e., HOMO–LUMO) gaps of such graphs, ii) to find out three classes of inversely proportional graphs (with inversely proportional pairs of eigenvalues), and iii) to express eigenspectra of some complicated graphs in analytical forms along with some subspectral relationships. In the limit of n (number of vertices) to infinity, the band gap of the graph of class I has been shown to be the same with that calculated by considering its hypothetical “cyclic dimer.” Reciprocal graphs have also been considered in this context. These graphs are not all hypothetical. A few of them have also been synthesized.
Title: Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Description:
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.
These graphs (particularly class I and III) represent heteroconjugated π-systems.
Sometimes such graphs appear as factored subgraphs of some complicated graphs.
The eigenspectra of these graphs have been found out in analytical forms.
These eigenspectra have been utilized i) to calculate the band (i.
e.
, HOMO–LUMO) gaps of such graphs, ii) to find out three classes of inversely proportional graphs (with inversely proportional pairs of eigenvalues), and iii) to express eigenspectra of some complicated graphs in analytical forms along with some subspectral relationships.
In the limit of n (number of vertices) to infinity, the band gap of the graph of class I has been shown to be the same with that calculated by considering its hypothetical “cyclic dimer.
” Reciprocal graphs have also been considered in this context.
These graphs are not all hypothetical.
A few of them have also been synthesized.
Related Results
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 –...
Product of digraphs, (super) edge-magic valences and related problems
Product of digraphs, (super) edge-magic valences and related problems
Discrete Mathematics, and in particular Graph Theory, has gained a lot of popularity during the last 7 decades. Among the many branches in Graph Theory, graph labelings has experim...
Magic graphs
Magic graphs
DE LA TESIS<br/>Si un graf G admet un etiquetament super edge magic, aleshores G es diu que és un graf super edge màgic. La tesis està principalment enfocada a l'estudi del c...
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...
On Weighted Vertex and Edge Mostar Index for Trees and Cacti with Fixed Parameter
On Weighted Vertex and Edge Mostar Index for Trees and Cacti with Fixed Parameter
It was introduced by Doˇsli ́c and Ivica et al. (Journal of Mathematical chemistry, 56(10) (2018): 2995–3013), as an innovative graph-theoretic topological identifier, the Mostar i...
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...
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=(...

