Results 31 to 40 of about 1,315,432 (182)
‘Minesweeper’ and spectrum of discrete Laplacians [PDF]
We add consideration of tables based on the triangle tiling of the plane.
German, Oleg, Lakshtanov, Evgeny
openaire +2 more sources
Tarantula graphs are determined by their Laplacian spectrum
A graph G is said to be determined by its Laplacian spectrum (DLS) if every graph with the same Laplacian spectrum is isomorphic to G. A graph which is a collection of hexagons (lengths of these cycles can be different) all sharing precisely one vertex ...
Reza Sharafdini, Ali Zeydi Abdian
doaj +1 more source
Some Chemistry Indices of Clique-Inserted Graph of a Strongly Regular Graph
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 +1 more source
Editorial Note: Impact of COVID-19 on Spectrum operations
To support our authors, reviewers and editors during the COVID-19 pandemic, the Spectrum Editorial Board has relaxed its timelines for the publication of this most recent issue (Issue 5). We are working with our authors on their Issue 5 submissions,
Editorial Board, Spectrum
core +1 more source
On the construction of L-equienergetic graphs
For a graph G with n vertices and m edges, and having Laplacian spectrum μ1,μ2,…,μn and signless Laplacian spectrum μ1+,μ2+,…,μn+, the Laplacian energy and signless Laplacian energy of G are respectively, defined as LE(G)=∑i=1n|μi−2mn| and LE+(G)=∑i=1n ...
S. Pirzada, Hilal A. Ganie
doaj +1 more source
On the Spectra of Commuting and Non Commuting Graph on Dihedral Group
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]
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 -joins of two regular graphs
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, -vertex join, and -edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs. Moreover, applying
Arpita Das, Pratima Panigrahi
doaj +2 more sources
Signless Laplacian determinations of some graphs with independent edges
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
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

