On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue [PDF]
Mathematics, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur +3 more
doaj +5 more sources
Bounds on the Spectral Radius of a Nonnegative Matrix and Its Applications [PDF]
Journal of Applied Mathematics, Volume 2016, Issue 1, 2016., 2016 We obtain the sharp bounds for the spectral radius of a nonnegative matrix and then obtain some known results or new results by applying these bounds to a graph or a digraph and revise and improve two known results.
Danping Huang, Lihua You, Ali R. Ashrafi
wiley +4 more sources
Upper and Lower Bounds for the Spectral Radius of Generalized Reciprocal Distance Matrix of a Graph
Mathematics, 2022 For a connected graph G on n vertices, recall that the reciprocal distance signless Laplacian matrix of G is defined to be RQ(G)=RT(G)+RD(G), where RD(G) is the reciprocal distance matrix, RT(G)=diag(RT1,RT2,⋯,RTn) and RTi is the reciprocal distance ...
Yuzheng Ma, Yubin Gao, Yanling Shao
doaj +1 more source
On the Sum and Spread of Reciprocal Distance Laplacian Eigenvalues of Graphs in Terms of Harary Index [PDF]
, 2022 The reciprocal distance Laplacian matrix of a connected graph G is defined as RDL(G)=RT(G)−RD(G), where RT(G) is the diagonal matrix of reciprocal distance degrees and RD(G) is the Harary matrix.
Khan, Saleem +2 more
core +2 more sources
On the Laplacian and Signless Laplacian Characteristic Polynomials of a Digraph [PDF]
, 2022 Let D be a digraph with n vertices and a arcs. The Laplacian and the signless Laplacian matrices of D are, respectively, defined as L(D)=Deg+(D)−A(D) and Q(D)=Deg+(D)+A(D), where A(D) represents the adjacency matrix and Deg+(D) represents the diagonal ...
Ganie, Hilal A., Shang, Yilun
core +1 more source
ISI spectral radii and ISI energies of graph operations [PDF]
, 2023 Graph energy is defined to be the p-norm of adjacency matrix associated to the graph for p = 1 elaborated as the sum of the absolute eigenvalues of adjacency matrix.
Ahmad Bilal +3 more
core +1 more source
The Total π-Electron Energy Saga [PDF]
, 2017 The total π-electron energy, as calculated within the Hückel tight-binding molecular orbital approximation, is a quantum-theoretical characteristic of conjugated molecules that has been conceived as early as in the 1930s. In 1978, a minor modification of
Gutman, Ivan, Furtula, Boris
core +5 more sources
Analysis of Stakeholders’ Interest and Influence in Non-Timber Forest Products Marketing: A Case Study in the Forest Management Unit Batutegi, Lampung [PDF]
, 2023 Stakeholders are involved in the management of the Forest Management Unit (FMU) Batutegi, including the marketing of non-timber forest products (NTFP).
Dwi Kurniati, Hardjanto, Soni Trison
core +2 more sources
New bounds for the signless Laplacian spread [PDF]
, 2018 Let $G$ be an undirected simple graph. The signless Laplacian spread of $G$ is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both lower and upper, for the signless Laplacian spread.
Andrade, Enide +3 more
core +2 more sources
Spectral Properties of the Harary Signless Laplacian and Harary Incidence Energy
MathematicsLet 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
Luis Medina +2 more
doaj +1 more source