Results 21 to 30 of about 2,064,253 (190)
Distance (signless) Laplacian spectrum of dumbbell graphs [PDF]
Transactions on Combinatorics, 2023 In this paper, we determine the distance Laplacian and distance signless Laplacian spectrum of generalized wheel graphs and a new class of graphs called dumbbell graphs.
Sakthidevi Kaliyaperumal +1 more
doaj +1 more source
A special class of triple starlike trees characterized by Laplacian spectrum
AIMS Mathematics, 2021 Two graphs are said to be cospectral with respect to the Laplacian matrix if they have the same Laplacian spectrum. A graph is said to be determined by the Laplacian spectrum if there is no other non-isomorphic graph with the same Laplacian spectrum.
M. Ajmal +5 more
semanticscholar +1 more source
Constraints on Brouwer's Laplacian spectrum conjecture [PDF]
Linear Algebra and its Applications, 2020 Brouwer's Conjecture states that, for any graph $G$, the sum of the $k$ largest (combinatorial) Laplacian eigenvalues of $G$ is at most $|E(G)| + \binom{k+1}{2}$, $1 \leq k \leq n$.
Joshua N. Cooper
semanticscholar +1 more source
Hyper-Wiener index and Laplacian spectrum [PDF]
Journal of the Serbian Chemical Society, 2003 The hyper-Wiener index WWW of a chemical tree T is defined as the sum of the product n1 n2 n3, over all pairs u, u of vertices of T, where n1 and n2 are the number of vertices of T, lying on the two sides of the path which connects u and u, and n3 is the
IVAN GUTMAN
doaj +3 more sources
Computing the Laplacian Spectrum of Linear Octagonal-Quadrilateral Networks and Its Applications [PDF]
Polycyclic aromatic compounds (Print), 2019 As a powerful tool for describing and studying the properties of compounds, the graphs spectrum analysis and calculations have attracted substantial attention of the scientific community. Let On denote linear octagonal-quadrilateral networks.
Jia-bao Liu +6 more
semanticscholar +1 more source
Results on Laplacian spectra of graphs with pockets
AKCE International Journal of Graphs and Combinatorics, 2018 Let F , H v be simple connected graphs on n and m + 1 vertices, respectively. Let v be a specified vertex of H v and u 1 , … , u k ∈ F . Then the graph G = G [ F , u 1 , … , u k , H v ] obtained by taking one copy of F and k copies of H v , and then ...
Sasmita Barik, Gopinath Sahoo
doaj +2 more sources
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
Spectra of the extended neighborhood corona and extended corona of two graphs
Electronic Journal of Graph Theory and Applications, 2016 In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively.
Chandrashekar Adiga +2 more
doaj +1 more source
Magnetic Dirichlet Laplacian in curved waveguides [PDF]
Opuscula MathematicaFor a two-dimensional curved waveguide, it is well known that the spectrum of the Dirichlet Laplacian is unstable with respect to waveguide deformations. This means that if the waveguide is a straight strip then the spectrum of the Dirichlet Laplacian is
Diana Barseghyan +3 more
doaj +1 more source
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 +1 more source