Results 11 to 20 of about 1,309,008 (158)
The signless Laplacian matrix of hypergraphs [PDF]
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
Signless normalized Laplacian for hypergraphs [PDF]
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 +2 more sources
Color signless Laplacian energy of graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this paper, we introduce the new concept of color Signless Laplacian energy . It depends on the underlying graph and the colors of the vertices. Moreover, we compute color signless Laplacian spectrum and the color signless Laplacian energy of families
Pradeep G. Bhat, Sabitha D’Souza
doaj +2 more sources
The sun graph is determined by its signless Laplacian spectrum [PDF]
The Electronic Journal of Linear Algebra, 2010 For a simple undirected graph G, the corresponding signless Laplacian matrix is defined as D(G) + A(G) in which D(G) and A(G) are degree matrix and adjacency matrix of G, respectively. The graph G is said to be determined by its signless Laplacian spectrum, if any graph having the same signless Laplacian spectrum as G is isomorphic to G.
Maryam Mirzakhah, Dariush Kiani
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
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
Journal of Mathematics, Volume 2021, Issue 1, 2021., 2021 Let G be a graph with n vertices, and let L(G) and Q(G) denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic matrix of L(G) (respectively, Q(G)).
Tingzeng Wu +2 more
wiley +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
On the Laplacian and signless Laplacian spectrum of a graph with
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abreu, Nair M. M. +4 more
core +6 more sources
On Generalized Harary Eigenvalues and Generalized Join of Graphs
Journal of MathematicsIn this work, we further study the generalized Harary matrix of a connected graph G, which we denote by RDαG. This matrix is defined as the convex combination RDαG=αRTG+1−αRDG, where 0≤α≤1.
Abdollah Alhevaz +3 more
doaj +2 more sources