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

Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy

View through CrossRef
Let X be a partitioned matrix and let B its equitable quotient matrix. Consider a simple, undirected, connected graph G of order n. In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new spectral results for the reciprocal distance signless Laplacian matrix. In particular, we identify a sequence of graphs whose eigenvalues are all integers. Furthermore, we introduce the concept of Harary incidence energy and extend known incidence energy results to the setting of the reciprocal distance signless Laplacian matrix. Finally, we characterize the Harary incidence energy of extremal graphs by examining vertex connectivity through the generalized graph join operation.
Title: Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Description:
Let X be a partitioned matrix and let B its equitable quotient matrix.
Consider a simple, undirected, connected graph G of order n.
In this paper, we employ a technique based on quotient matrices derived from block-partitioned structures to establish new spectral results for the reciprocal distance signless Laplacian matrix.
In particular, we identify a sequence of graphs whose eigenvalues are all integers.
Furthermore, we introduce the concept of Harary incidence energy and extend known incidence energy results to the setting of the reciprocal distance signless Laplacian matrix.
Finally, we characterize the Harary incidence energy of extremal graphs by examining vertex connectivity through the generalized graph join operation.

Related Results

The spectrum and metric dimension of Indu–Bala product of graphs
The spectrum and metric dimension of Indu–Bala product of graphs
Given a connected graph [Formula: see text], the distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], and the distance signless Laplacian matrix [Formul...
Harary spectra and Harary energy of line graphs of regular graphs
Harary spectra and Harary energy of line graphs of regular graphs
The Harary matrix of a graph G is defined as RD(G) = [rij] in which rij = 1 ∕ dij if i ≠ j and rij = 0 if i = j, where dij is the distance between the vertices vi and vj in G. The ...
Trees with Four and Five Distinct Signless Laplacian Eigenvalues
Trees with Four and Five Distinct Signless Laplacian Eigenvalues
‎‎Let $G$ be a simple graph with vertex set $V(G)=\{v_1‎, ‎v_2‎, ‎\cdots‎, ‎v_n\}$ ‎and‎‎edge set $E(G)$‎.‎The signless Laplacian matrix of $G$ is the matrix $‎Q‎‎=‎D‎+‎A‎‎$‎, ‎suc...
Tightness of Harary Graphs
Tightness of Harary Graphs
In the design of real-world networks, researchers evaluate various structural parameters to assess vulnerability, including connectivity, toughness, and tenacity. Recently, the tig...
New Spectral Results for Laplacian Harary Matrix and the Harary Laplacian-Energy-like Applying a Matrix Order Reduction
New Spectral Results for Laplacian Harary Matrix and the Harary Laplacian-Energy-like Applying a Matrix Order Reduction
In this paper, we introduce the concepts of Harary Laplacian-energy-like for a simple undirected and connected graph G with order n. We also establish novel matrix results in this ...
The Eigenvalues-Based Entropy and Spectrum of the Directed Cycles
The Eigenvalues-Based Entropy and Spectrum of the Directed Cycles
The directed cycles form a foundational structure within a network model. By analyzing the in-degree characteristic polynomial of three kinds of matrices of the directed cycles, th...
On Laplacian Commutativity of Graphs
On Laplacian Commutativity of Graphs
This paper introduces the notion of Laplacian commutativity of graphs among well known classes of graphs. Two graphs are Laplacian commutative if their Laplacian matrices commute. ...

Back to Top