[PDF] Top 20 New bounds for the signless Laplacian spread

... We may now obtain different lower bounds on the signless Laplacian spread sQ G, for a graph G, by applying Theorem 14 to the signless Laplacian matrix QG and choosing some specific unit ve[r] ... See full document

... ω. The bandwidth ω(G) of the graph G is the smallest possible bandwidth for its adjacency matrix (or Laplacian ...matrix). The spread of an n × n complex hermitian matrix M with ... See full document

... upper bounds for the Laplacian spread of connected ...In the next section, using a theorem due to Brauer we obtain a new matrix whose matricial spread coincides with ... See full document

... G. The determination of the order of a k-regular induced subgraph of highest order is in general an NP-hard ...to the study of spectral upper bounds on the order of these subgraphs ... See full document

... M. The extremal graphs on the number of edges with dominating induced matchings are characterized by its Laplacian spectrum and its principal Laplacian ...Adjacency, Laplacian and ... See full document

... in the following way. In Section 2 a lower bound for the signless Laplacian index of graphs with at least one (κ, τ)-regular set is deduced under different suitable ...illustrate the ... See full document

... a new and improved upper bound for the Laplacian energy of graphs whose Laplacian characteristic polynomial can be decomposed as a product of other characteristic ...for the mentioned ... See full document

... of the vertex degrees, is known as Laplacian matrix or the Laplacian of ...called the Laplacian spectrum of G. Additional properties for the adjacency and Laplacian ... See full document

... results, the characterizations of graphs G whose complementary prisms attain lower bounds on domination and total domina- tion numbers introduced in [8], were ...[6] the authors studied algo- ... See full document

... is, the maximum absolute value of the difference between its pairwise distinct Randi´ c eigenvalues, disregarding the Randi´ c spectral ...upper bounds for this spec- tral invariant were ... See full document

... so the lower bound is always ...displaying the constant c as a function of the distributional ...for the exponential, half-normal and uniform distributions in view that c does not vary for ... See full document

... Besides the Grant SFRH/BSAB/135242/2017 of the Portuguese Foundation for Science and Technology FCT, Portugal, which made this visit possible, the second author also wishes to thank to P[r] ... See full document

... In the case where Ω is a ball, the p-torsion function is also radially symmetric and the corresponding radial version of the torsional creep problem is rewritten as a boundary value problem ... See full document

... on the trace formula. Over the last few years these questions have led to the development of a theory for the spectral properties of the eigenfunctions of the Laplacian on ... See full document

... for the computing times. In particular, the CPU time spent by the CG algorithm for instance Vertebral column with g = 10 is approximately ...for the larger data sets. Furthermore, the ... See full document

... for the family of eigenfunctions and fundamental solutions of the three-parameter fractional ...For the sake of simplicity we restrict ourselves to the three dimensional case, however ... See full document

... of the most intriguing aspects of quantum theory which reveals that nature is intrinsically different than our classical view of the ...of the main goals in the study of quantum nonlocality is ... See full document

... In finite dimensional linear algebra, the power method is often used in order to compute the first eigenvalue of invertible linear operators defined on Euclidean spaces (see [9], for ins[r] ... See full document

... with the Randi´ c index, the matrix R seems to be first time used in 2005 by Rodr´ıguez, who referred to it as the “weighted adjacency matrix” [34] and the “degree adjacency matrix” ...of ... See full document

... approximate the eigenvalues of the Laplacian as those of a finite linear ...on the uniform convergence away from nodal surfaces and can produce a simple and fast algorithm for computing ... See full document