Results 11 to 20 of about 858 (123)
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
Complexity, 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique-inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique-inserted graph of strongly regular graph are calculated.
Chun-Li Kan +3 more
doaj +2 more sources
Spectral Sufficient Conditions on Pancyclic Graphs
Complexity, 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.
Guidong Yu +3 more
doaj +2 more sources
The signless Laplacian matrix of hypergraphs
Special Matrices, 2022 In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj +2 more sources
On some forests determined by their Laplacian or signless Laplacian spectrum
Computers & Mathematics with Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Simić, Slobodan K., Stanić, Zoran
openaire +4 more sources
The spectrum and the signless Laplacian spectrum of coronae
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cui, Shu-Yu, Tian, Gui-Xian
openaire +4 more sources
Complete split graph determined by its (signless) Laplacian spectrum
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Ch. Das, Muhuo Liu
openaire +3 more sources
Graphs determined by signless Laplacian spectra
AKCE International Journal of Graphs and Combinatorics, 2020 In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning.
Ali Zeydi Abdian +2 more
doaj +2 more sources
$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
(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