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...
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...
DISCRETIZATION OF LAPLACIAN OPERATOR IN POLAR COORDINATE SYSTEM, USING CRANK-NICOLSON’S (CN) SCHEME AND STABILITY ANALYSIS
DISCRETIZATION OF LAPLACIAN OPERATOR IN POLAR COORDINATE SYSTEM, USING CRANK-NICOLSON’S (CN) SCHEME AND STABILITY ANALYSIS
Laplacian operator plays a vital role for describing and solving many mathematical models. Finite difference Scheme of Laplacian operator has been carried out by various researcher...
Deep learning based spectral extrapolation for dual‐source, dual‐energy x‐ray computed tomography
Deep learning based spectral extrapolation for dual‐source, dual‐energy x‐ray computed tomography
PurposeData completion is commonly employed in dual‐source, dual‐energy computed tomography (CT) when physical or hardware constraints limit the field of view (FoV) covered by one ...
SPECTRAL BOUNDS FOR LAPLACIAN ENERGY VIA WEIGHTED EIGENVALUE DEVIATIONS
SPECTRAL BOUNDS FOR LAPLACIAN ENERGY VIA WEIGHTED EIGENVALUE DEVIATIONS
In this paper, we study Laplacian energy using a parameterized spectral framework based on deviations of Laplacian eigenvalues from the average degree. The approach introduces a we...
[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...