Results 91 to 100 of about 140 (117)

Sharp Upper Bounds on the Spectral Radius of the Signless Laplacian Matrix of a Graph

Applied Mathematics and Computation, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kinkar Chandra Das, A Sinan Çevik
exaly   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

The Signless Laplacian Spectral Radius of Graphs With Given Number of Pendant Vertices

Graphs and Combinatorics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi-Zheng Fan
exaly   +4 more sources

The signless Laplacian spectral radius of graphs on surfaces

Linear and Multilinear Algebra, 2013
Let G be an n-vertex simple graph embeddable on a surface of Euler genus γ. We present the upper bounds for the signless Laplacian spectral radius of G in terms of n and γ, with further improvements when G is an outerplanar or Halin graph.
Lihua Feng, Guihai Yu, Aleksandar Ilić, Dragan Stevanović   +3 more
openaire   +1 more source

On the distance signless Laplacian spectral radius of graphs

Linear and Multilinear Algebra, 2013
The distance signless Laplacian spectral radius of a connected graph G is the spectral radius of the distance signless Laplacian matrix of G, defined as where is the diagonal matrix of vertex transmissions of G and is the distance matrix of G. In this paper, we determine the graphs with minimum distance signless Laplacian spectral radius among the ...
Rundan Xing, Bo Zhou, Jianping Li
openaire   +1 more source

The signless Laplacian spectral radius of 2K3-free graphs

Discrete Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanting Zhang, Ligong Wang 0001
openaire   +1 more source

Sharp Bounds for the Signless Laplacian Spectral Radius of Uniform Hypergraphs

Bulletin of the Iranian Mathematical Society, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
He, Jun, Liu, Yan-Min, Tian, Jun-Kang, Liu, Xiang-Hu   +3 more
openaire   +2 more sources

On the signless Laplacian spectral radius of digraphs.

Ars Comb., 2013
Let G = (V, E) be a digraph with n vertices and m arcs without loops and multiarcs, V = {v(1), v(2), ... , v(n)}. Denote the outdegree and average 2-outdegree of the vertex v(i) by d(i)(+) and m(i)(+), respectively. Let A (G) be the adjacency matrix and D (G) = diag (d(1)(+), d(2)(+), ... , d(n)(+)) be the diagonal matrix with outdegree of the vertices
Bozkurt, S. Burcu, Bozkurt, Durmus
openaire   +2 more sources

The signless Laplacian spectral radius of k-connected irregular graphs

Linear Algebra and its Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ning, Wenjie, Lu, Mei, Wang, Kun, Jiang, Daqing   +3 more
openaire   +1 more source

The signless Laplacian spectral radius of book-free graphs

Discrete Mathematics
For a positive integer \(k\), a book \(B_{k+1}\) is a graph consisting of \(k + 1\) triangles sharing a common edge. Let \(G\) be a \(B_{k+1}\)-free graph of order \(n \geq 49k^{2}-22k+4\). In this paper it is proved that the signless Laplacian spectral radius \(q(G) \leq (n+2k+\sqrt{(n-2k)^2+8k^2})/2\) with equality if and only if \(G = \overline{K_k}
Ming-Zhu Chen, Ya-Lei Jin, Peng-Li Zhang
openaire   +2 more sources

TWO SHARP UPPER BOUNDS FOR THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS

Discrete Mathematics, Algorithms and Applications, 2011
The signless Laplacian matrix of a graph is the sum of its degree diagonal and adjacency matrices. In this paper, we present a sharp upper bound for the spectral radius of the adjacency matrix of a graph. Then this result and other known results are used to obtain two new sharp upper bounds for the signless Laplacian spectral radius.
Ya-Hong Chen, Rong-Ying Pan, Xiao-Dong Zhang 0001   +2 more
openaire   +2 more sources