Results 11 to 20 of about 68,836 (161)
On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph [PDF]
Czechoslovak Mathematical Journal, 2013 The authors prove a number of formulas on the characteristic polynomials of the Laplacian, signless Laplacian and normalized Laplacian matrices of graphs. The use of these formulas is exemplified in constructions of graphs cospectral with respect to the appropriate matrix.
Guo, Ji-Ming, Li, Jianxi, Shiu, Wai Chee
openaire +3 more sources
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xi, Weige, Wang, Ligong
openaire +3 more sources
Graphs with maximum Laplacian and signless Laplacian Estrada index
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gutman, Ivan +3 more
openaire +3 more sources
On the spectral radius and energy of signless Laplacian matrix of digraphs. [PDF]
Heliyon, 2022 Ganie HA, Shang Y.
europepmc +2 more sources
(Generalized) Incidence and Laplacian‐Like Energies
Journal of Mathematics, Volume 2023, Issue 1, 2023., 2023 In this study, for graph Γ with r connected components (also for connected nonbipartite and connected bipartite graphs) and a real number ε(≠0,1), we found generalized and improved bounds for the sum of ε‐th powers of Laplacian and signless Laplacian eigenvalues of Γ.
A. Dilek Maden +2 more
wiley +1 more source
On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number
Discrete Dynamics in Nature and Society, Volume 2022, Issue 1, 2022., 2022 A supertree is a connected and acyclic hypergraph. Denote by Tm,n,α the set of m‐uniform supertrees of order n with independent number α. Focusing on the spectral radius in Tm,n,α, this present completely determines the hypergraphs with maximum spectral radius among all the supertrees with n vertices and independence number α for [m − 1/mn] ≤ α ≤ n − 1,
Lei Zhang +2 more
wiley +1 more source
Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks
Journal of Mathematics, Volume 2022, Issue 1, 2022., 2022 Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks. Meanwhile, the weight is a vital factor in characterizing some properties of real networks.
Haiqin Liu, Yanling Shao, Azhar Hussain
wiley +1 more source
New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 Let G be a simple connected graph with vertex set V(G) = {v1, v2, …, vn} and dvi be the degree of the vertex vi. Let D(G) be the distance matrix and Tr(G) be the diagonal matrix of the vertex transmissions of G. The generalized distance matrix of G is defined as Dα(G) = αTr(G) + (1 − α)D(G), where 0 ≤ α ≤ 1. If λ1, λ2, …, λn are the eigenvalues of Dα(G)
Yuzheng Ma +3 more
wiley +1 more source
Spectral Sufficient Conditions on Pancyclic Graphs
Complexity, Volume 2021, Issue 1, 2021., 2021 A pancyclic graph of order n is a graph with cycles of all possible lengths from 3 to n. In fact, it is NP‐complete that deciding whether a graph is pancyclic. Because the spectrum of graphs is convenient to be calculated, in this study, we try to use the spectral theory of graphs to study this problem and give some sufficient conditions for a graph to
Guidong Yu +4 more
wiley +1 more source
On Laplacian Equienergetic Signed Graphs
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Qingyun Tao, Lixin Tao, Yongqiang Fu
wiley +1 more source