Results 31 to 40 of about 140 (117)
On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue
Mathematics, 2021 The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the ...
Maryam Baghipur +3 more
doaj +1 more source
Maxima of the signless Laplacian spectral radius for planar graphs [PDF]
The Electronic Journal of Linear Algebra, 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 456$.
Guanglong Yu +2 more
openaire +1 more source
Resistance Distance and Kirchhoff Index for a Class of Graphs
Mathematical Problems in Engineering, Volume 2018, Issue 1, 2018., 2018 Let G[F, Vk, Hv] be the graph with k pockets, where F is a simple graph of order n ≥ 1, Vk = {v1, v2, …, vk} is a subset of the vertex set of F, Hv is a simple graph of order m ≥ 2, and v is a specified vertex of Hv. Also let G[F, Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek = {e1, e2, …ek} is a subset of the ...
WanJun Yin +3 more
wiley +1 more source
The Minimum Spectral Radius of Signless Laplacian of Graphs with a Given Clique Number
Discussiones Mathematicae Graph Theory, 2014 In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω.
Su Li, Li Hong-Hai, Zhang Jing
doaj +1 more source
On the distance α-spectral radius of a connected graph
Journal of Inequalities and Applications, 2020 For a connected graph G and α ∈ [ 0 , 1 ) $\alpha \in [0,1)$ , the distance α-spectral radius of G is the spectral radius of the matrix D α ( G ) $D_{\alpha }(G)$ defined as D α ( G ) = α T ( G ) + ( 1 − α ) D ( G ) $D_{\alpha }(G)=\alpha T(G)+(1-\alpha )
Haiyan Guo, Bo Zhou
doaj +1 more source
On the signless Laplacian spectral radius of irregular graphs
Linear Algebra and its Applications, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ning, Wenjie, Li, Hao, Lu, Mei
openaire +2 more sources
Some Properties of the Strong Primitivity of Nonnegative Tensors
Journal of Applied Mathematics, Volume 2018, Issue 1, 2018., 2018 We show that an order m dimension 2 tensor is primitive if and only if its majorization matrix is primitive, and then we obtain the characterization of order m dimension 2 strongly primitive tensors and the bound of the strongly primitive degree. Furthermore, we study the properties of strongly primitive tensors with n ≥ 3 and propose some problems for
Lihua You +3 more
wiley +1 more source
Characterizing the Signless Laplacian H-Spectral Radius for Uniform Directed Hypergraphs
AxiomsThe importance of the signless Laplacian H-spectral radius is highlighted by its known links to connectivity and the maximum cut and independence number.
Hanqing Song +4 more
doaj +1 more source
Spectral Radius and Hamiltonicity of Graphs
Discussiones Mathematicae Graph Theory, 2019 In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or its complement,
Yu Guidong +3 more
doaj +1 more source
Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
Linear Algebra and its Applications, 2014 20 pages, 6 ...
Wenxi Hong, Lihua You
openaire +3 more sources