Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
New Spectral Results for Laplacian Harary Matrix and the Harary Laplacian-Energy-like Applying a Matrix Order Reduction
View through CrossRef
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 regard. Furthermore, by employing matrix order reduction techniques, we derive upper and lower bounds utilizing existing graph invariants and vertex connectivity. Finally, we characterize the graphs that achieve the aforementioned bounds by considering the generalized join operation of graphs.
Title: New Spectral Results for Laplacian Harary Matrix and the Harary Laplacian-Energy-like Applying a Matrix Order Reduction
Description:
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 regard.
Furthermore, by employing matrix order reduction techniques, we derive upper and lower bounds utilizing existing graph invariants and vertex connectivity.
Finally, we characterize the graphs that achieve the aforementioned bounds by considering the generalized join operation of graphs.
Related Results
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 ...
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
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 qu...
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...
[RETRACTED] Prima Weight Loss Dragons Den UK v1
[RETRACTED] Prima Weight Loss Dragons Den UK v1
[RETRACTED]Prima Weight Loss Dragons Den UK :-Obesity is a not kidding medical issue brought about by devouring an excessive amount of fat, eating terrible food sources, and practi...
[RETRACTED] Prima Weight Loss Dragons Den UK v1
[RETRACTED] Prima Weight Loss Dragons Den UK v1
[RETRACTED]Prima Weight Loss Dragons Den UK :-Obesity is a not kidding medical issue brought about by devouring an excessive amount of fat, eating terrible food sources, and practi...
Space Weathering simulation on the Aubrite meteorite NWA 13278, putative analogue of Mercury
Space Weathering simulation on the Aubrite meteorite NWA 13278, putative analogue of Mercury
IntroductionThe surface of Mercury as seen by the MESSENGER spacecraft is mostly featureless in the Visible-to-Near-Infrared range (VIS-to-NIR) [1-4], except for some restricted lo...
A note on the Seidel and Seidel Laplacian matrices
A note on the Seidel and Seidel Laplacian matrices
In this paper we investigate the spectrum of the Seidel and Seidel Laplacian matrix of a graph. We generalized the concept of Seidel Laplacian matrix which denoted by Seidel matrix...
The Application of S‐transform Spectrum Decomposition Technique in Extraction of Weak Seismic Signals
The Application of S‐transform Spectrum Decomposition Technique in Extraction of Weak Seismic Signals
AbstractIn processing of deep seismic reflection data, when the frequency band difference between the weak useful signal and noise both from the deep subsurface is very small and h...