Results 31 to 40 of about 5,819 (125)
THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA [PDF]
Journal of Algebraic Systems, 2020 The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph.
A. Zeydi Abdian +2 more
doaj +1 more source
(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
Signless normalized Laplacian for hypergraphs
Electronic Journal of Graph Theory and Applications, 2022 The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
Eleonora Andreotti, Raffaella Mulas
doaj +1 more source
$Kite_{p+2,p}$ is determined by its Laplacian spectrum [PDF]
Transactions on Combinatorics, 2021 $Kite_{n,p}$ denotes the kite graph that is obtained by appending complete graph with order $p\geq4$ to an endpoint of path graph with order $n-p$. It is shown that $Kite_{n,p}$ is determined by its adjacency spectrum for all $p$ and $n$ [H.
Hatice Topcu
doaj +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 properties of the commuting graphs of certain groups
AKCE International Journal of Graphs and Combinatorics, 2019 Let G be a finite group. The commuting graph Γ=C(G)is a simple graph with vertex set G and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj +2 more sources
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
Sufficient Conditions for Graphs to Be k‐Connected, Maximally Connected, and Super‐Connected
Complexity, Volume 2021, Issue 1, 2021., 2021 Let G be a connected graph with minimum degree δ(G) and vertex‐connectivity κ(G). The graph G is k‐connected if κ(G) ≥ k, maximally connected if κ(G) = δ(G), and super‐connected if every minimum vertex‐cut isolates a vertex of minimum degree. In this paper, we present sufficient conditions for a graph with given minimum degree to be k‐connected ...
Zhen-Mu Hong +4 more
wiley +1 more source