Results 91 to 100 of about 110,880 (163)
Spectra of R-Vertex Join and R-Edge Join of Two Graphs
Discussiones Mathematicae - General Algebra and Applications, 2018 The R-graph R(G) of a graph G is the graph obtained from G by intro- ducing a new vertex ue for each e ∈ E(G) and making ue adjacent to both the end vertices of e. In this paper, we determine the adjacency, Lapla- cian and signless Laplacian spectra of R-
Das Arpita, Panigrahi Pratima
doaj +1 more source
The bounds of eigenvalues of normalized Laplacian matrice and signless Laplacian matrice
, 2013 Bu çalışmada grafın komşuluk matrisi derece matrisi ve Laplacian matrisi yardımıyla tanımlanan işaretsiz(signless) Laplacian matris ile normalleştirilmiş Laplacian matrisin özdeğerleri için sınırlar bulunmuştur.We found the bounds of eigenvalues of ...
Eski, Şehri Gülçiçek
core
A lower bound on the least signless Laplacian eigenvalue of a graph
Linear Algebra and its Applications, 2014 Let $G$ be a simple connected graph on $n$ vertices and $m$ edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalue $q_n(G)$ of the signless Laplacian of $G$: $\displaystyle q_n(G)\ge {2m}/{(n-1)}-n+2$.
Guo, Shu-Guang +2 more
openaire +3 more sources
, 2021 Let G be a graph with n vertices, and let LG and QG 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 ...
Tingzeng Wu, Tian Zhou
core +1 more source
H$^+$-Eigenvalues of Laplacian and Signless Laplacian Tensors
, 2013 We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H$^{++}$-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors.
openaire +2 more sources
Toughness and signless Laplacian eigenvalues in graphs
The Electronic Journal of Linear AlgebraFor a non-complete connected graph $G$, the toughness of $G$ is defined as $t(G)=\min\Big\{\frac{|S|}{c(G-S)}\Big\}$ by Chvátal, in which the minimum is taken over all proper sets $S\subset V(G)$, where $c(G-S)$ denotes the number of components of $G-S$ and $c(G-S)\ge2$. A graph $G$ is called $t$-tough if $t(G)\geq t$.
Shuaiwei Zhai +3 more
openaire +1 more source
, 2018 In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater than 2. We prove that all these graphs are determined by the spectrum of their Laplacian matrix, and that all these graphs except the star on four vertices ...
Jianfeng Wang +2 more
core
Edge perturbation on graphs with clusters: Adjacency, Laplacian and signless Laplacian eigenvalues
Linear Algebra and its Applications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Domingos M. Cardoso, Oscar Rojo
openaire +2 more sources
Mathematics, 2019 Suppose that G is a simple undirected connected graph. Denote by D ( G ) the distance matrix of G and by T r ( G ) the diagonal matrix of the vertex transmissions in G, and let α ∈ [ 0 , 1 ] .
Abdollah Alhevaz +2 more
doaj +1 more source
Maxima of the signless Laplacian spectral radius for planar graphs [PDF]
, 2015 The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq
Yu, Guanglong +2 more
core +1 more source