Results 11 to 20 of about 6,200 (156)
Laplacian energy and first Zagreb index of Laplacian integral graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 The set Si,n = {0, 1, 2, …, i − 1, i + 1, …, n − 1, n}, 1 ⩽ i ⩽ n, is called Laplacian realizable if there exists a simple connected undirected graph whose Laplacian spectrum is Si,n. The existence of such graphs was established by S. Fallat et all.
Hameed Abdul +2 more
doaj +1 more source
Theory and Applications of Graphs, 2021 In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent.
Dhiren Basnet, Ajay Sharma, Rahul Dutta
doaj +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
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
Spectrum of the Laplacian on regular polyhedra
Communications on Pure and Applied Analysis, 2021 We study eigenvalues and eigenfunctions of the Laplacian on the surfaces of four of the regular polyhedrons: tetrahedron, octahedron, icosahedron and cube. We show two types of eigenfunctions: nonsingular ones that are smooth at vertices, lift to periodic functions on the plane and are expressible in terms of trigonometric polynomials; and singular ...
Greif, Evan +3 more
openaire +4 more sources
Laplacian Spectrum Learning [PDF]
, 2010 The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplacian to obtain a kernel. While manual exploration of the spectrum is conceivable, non-parametric learning methods that adjust the Laplacian's spectrum promise better performance.
Pannagadatta K. Shivaswamy, Tony Jebara
openaire +1 more source
The spectrum of the Laplacian of Kähler manifolds [PDF]
Proceedings of the American Mathematical Society, 1980 We strengthen some results on the spectrum of the Laplacian for 0- and 1-forms [ 8 ], [ 9 ] on Kähler manifolds and give some new results for the 2-forms.
Chen, Bang-Yen, Vanhecke, Lieven
openaire +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
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