Results 31 to 40 of about 6,200 (156)

On the Spectra of Commuting and Non Commuting Graph on Dihedral Group

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2017
Study about spectra of graph has became interesting work as well as study about commuting and non commuting graph of a group or a ring. But the study about spectra of commuting and non commuting graph of dihedral group has not been done yet.
Abdussakir Abdussakir   +2 more
doaj   +1 more source

Numerical Calculation of the Essential Spectrum of a Laplacian [PDF]

open access: yesExperimental Mathematics, 1999
We consider a bounded Rooms and Passages region Ω on which the negative Neumann laplacian (restricted to the orthogonal complement of the constant functions) does not have a compact inverse and hence has an essential spectrum. We try to understand how such spectra may be approximated by results from a sequence of finite-dimensional problems ...
Neuberger, J. W., Renka, R. J.
openaire   +2 more sources

Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2018
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, R-vertex join, and R-edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs.
Arpita Das, Pratima Panigrahi
doaj   +2 more sources

Signless Laplacian determinations of some graphs with independent edges

open access: yesKarpatsʹ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   +1 more source

On the sum of signless Laplacian spectra of graphs

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2019
For a simple graph $G(V,E)$ with $n$ vertices, $m$ edges, vertex set $V(G)=\{v_1, v_2, \dots, v_n\}$ and edge set $E(G)=\{e_1, e_2,\dots, e_m\}$, the adjacency matrix $A=(a_{ij})$ of $G$ is a $(0, 1)$-square matrix of order $n$ whose $(i,j)$-entry is ...
S. Pirzada, H.A. Ganie, A.M. Alghamdi
doaj   +1 more source

Exponential growth and the spectrum of the Laplacian [PDF]

open access: yesProceedings of the American Mathematical Society, 1981
Conditions are given on a noncompact manifold which allow one to conclude that 0 is in the spectrum of the Laplacian on M M
openaire   +2 more sources

A Surgery Result for the Spectrum of the Dirichlet Laplacian [PDF]

open access: yesSIAM Journal on Mathematical Analysis, 2015
In this paper we give a method to geometrically modify an open set such that the first $k$ eigenvalues of the Dirichlet Laplacian and its perimeter are not increasing, its measure remains constant, and both perimeter and diameter decrease below a certain threshold. The key point of the analysis relies on the properties of the shape subsolutions for the
Bucur, Dorin, Mazzoleni, Dario
openaire   +6 more sources

The coalescence of multi-wheel and starlike graphs is DLS [PDF]

open access: yesJournal of Mahani Mathematical Research
The Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum,  it means that  it can be identified by this spectrum, it is called $DLS ...
Mohammad Hasan Ahangarani Farahani   +1 more
doaj   +1 more source

On the cozero-divisor graphs associated to rings

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
Let R be a ring with unity. The cozero-divisor graph of a ring R, denoted by [Formula: see text] is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of R, and two distinct vertices x and y are adjacent if and ...
Praveen Mathil   +2 more
doaj   +1 more source

The spectrum of the Laplacian for 1-forms [PDF]

open access: yesProceedings of the American Mathematical Society, 1974
Let ( M , g ) (M,g)
openaire   +1 more source

Home - About - Disclaimer - Privacy