Results 11 to 20 of about 42,138 (164)
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 +3 more sources
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 +6 more sources
Eigenvalue bounds for the signless laplacian [PDF]
Publications de l'Institut Mathematique, 2007 We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bounds for eigenvalues are given, and the main result concerns the graphs whose largest eigenvalue is maximal among the graphs with fixed numbers of vertices and edges. The results are presented in the context of a number of computer-generated conjectures.
Cvetkovic, Dragos +2 more
openaire +3 more sources
Signless Laplacian determinations of some graphs with independent edges [PDF]
Karpatsʹkì Matematičnì Publìkacìï, 2018 Let $G$ be a simple undirected graph. Then the signless Laplacian matrix of $G$ is defined as $D_G + A_G$ in which $D_G$ and $A_G$ denote the degree matrix and the adjacency matrix of $G$, respectively.
R. Sharafdini, A.Z. Abdian
doaj +2 more sources
New bounds for the signless Laplacian spread [PDF]
Linear Algebra and its Applications, 2019 Let $G$ be a 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. Several of these bounds depend on invariant parameters of the graph.
Enide Andrade +3 more
core +9 more sources
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +2 more sources
Some results on the signless Laplacians of graphs
Applied Mathematics Letters, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Wang 0002 +3 more
openaire +4 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +2 more sources
(Generalized) Incidence and Laplacian-Like Energies
Journal of Mathematics, 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 ...
A. Dilek Maden, Mohammad Tariq Rahim
doaj +2 more sources
On Sum of Powers of the Laplacian and Signless Laplacian Eigenvalues of Graphs [PDF]
The Electronic Journal of Combinatorics, 2010 Let $G$ be a graph of order $n$ with signless Laplacian eigenvalues $q_1, \ldots,q_n$ and Laplacian eigenvalues $\mu_1,\ldots,\mu_n$. It is proved that for any real number $\alpha$ with $0 < \alpha\leq1$ or $2\leq\alpha < 3$, the inequality $q_1^\alpha+\cdots+ q_n^\alpha\geq \mu_1^\alpha+\cdots+\mu_n^\alpha$ holds, and for any real number ...
Saieed Akbari +3 more
openaire +4 more sources