Results 51 to 60 of about 306 (150)
Bounds on the Spectral Radius of a Nonnegative Matrix and Its Applications
Journal of Applied Mathematics, Volume 2016, Issue 1, 2016., 2016 We obtain the sharp bounds for the spectral radius of a nonnegative matrix and then obtain some known results or new results by applying these bounds to a graph or a digraph and revise and improve two known results.
Danping Huang, Lihua You, Ali R. Ashrafi
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
Signless Laplacian spectral radius and Hamiltonicity
Linear Algebra and its Applications, 2010 For an \(n\) vertex of a graph \(G\), the matrix \(L^*(G)=D(G)+A(G)\) is the signless Laplacian matrix of \(G\), where \(D(G)\) is the diagonal matrix of vertex degrees and \(A(G)\) is the adjacency matrix of \(G\). Let \(\gamma(G)\) be the largest eigenvalue of \(L^*(G)\).
openaire +1 more source
The Least Algebraic Connectivity of Graphs
Discrete Dynamics in Nature and Society, Volume 2015, Issue 1, 2015., 2015 The algebraic connectivity of a graph is defined as the second smallest eigenvalue of the Laplacian matrix of the graph, which is a parameter to measure how well a graph is connected. In this paper, we present two unique graphs whose algebraic connectivity attain the minimum among all graphs whose complements are trees, but not stars, and among all ...
Guisheng Jiang +3 more
wiley +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
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
On the Aα-Spectral Radii of Cactus Graphs
Mathematics, 2020 Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang +3 more
doaj +1 more source
k路覆盖图的新充分条件(New sufficient conditions on k -path-coverable graphs)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a simple connected graph of order n. A graph G is k-path-coverable if its vertex set V ( G ) can be covered by kor fewer vertex-disjoint paths. In this paper, we give some new sufficient conditions for a graph to be k-path-coverable in terms of ...
JIAHuicai(贾会才)
doaj +1 more source
Energy Conditions for Hamiltonicity of Graphs
Discrete Dynamics in Nature and Society, Volume 2014, Issue 1, 2014., 2014 Let G be an undirected simple graph of order n. Let A(G) be the adjacency matrix of G, and let μ1(G) ≤ μ2(G)≤⋯≤μn(G) be its eigenvalues. The energy of G is defined as ℰ(G)=∑i=1n |μi(G)|. Denote by GBPT a bipartite graph. In this paper, we establish the sufficient conditions for G having a Hamiltonian path or cycle or to be Hamilton‐connected in terms ...
Guidong Yu +4 more
wiley +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