Results 51 to 60 of about 140 (117)
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
Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs
Discussiones Mathematicae Graph Theory, 2016 Let G = (V (G),E(G)) be a simple strongly connected digraph and q(G) be the signless Laplacian spectral radius of G. For any vertex vi ∈ V (G), let d+i denote the outdegree of vi, m+i denote the average 2-outdegree of vi, and N+i denote the set of out ...
Xi Weige, Wang Ligong
doaj +1 more source
The Signless Laplacian Spectral Radius of Some Strongly Connected Digraphs
Indian Journal of Pure and Applied Mathematics, 2018 A \(\infty\)-digraph is a digraph consisting of many directed cycles with one common vertex. If Q is the signless Laplacian matrix of a strongly connected digraph G, the spectral radius of Q is called the signless Laplacian spectral radius of G. A \(\theta\)-graph is a graph consisting of three paths having the same end vertices.
Li, Xihe, Wang, Ligong, Zhang, Shangyuan
openaire +2 more sources
Mathematische Nachrichten, Volume 297, Issue 5, Page 1749-1771, May 2024.Abstract Landscape functions are a popular tool used to provide upper bounds for eigenvectors of Schrödinger operators on domains. We review some known results obtained in the last 10 years, unify several approaches used to achieve such bounds, and extend their scope to a large class of linear and nonlinear operators. We also use landscape functions to
Delio Mugnolo
wiley +1 more source
The Aα-Spectral Radii of Graphs with Given Connectivity
Mathematics, 2019 The A α -matrix is A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) with α ∈ [ 0 , 1 ] , given by Nikiforov in 2017, where A ( G ) is adjacent matrix, and D ( G ) is its ...
Chunxiang Wang, Shaohui Wang
doaj +1 more source
A Note on the Q-Spectral Radius and Aα-Spectral Radius of Graphs with Fixed Connectivity
MathematicsIn this paper, we characterize the graphs with a second maximum signless Laplacian spectral radius among all graphs with a fixed order and fixed vertex or edge connectivity.
Rong Zhang
doaj +1 more source
The signless Laplacian spectral radius of graphs without trees
, 2022 12 ...
Chen, Ming-Zhu +2 more
openaire +2 more sources
Distance (signless) Laplacian spectral radius of uniform hypergraphs
Linear Algebra and its Applications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongying Lin, Bo Zhou, Yanna Wang
openaire +2 more sources
Perturbation of the α-spectral radius of complete multipartite graphs
上海师范大学学报. 自然科学版Let G be a graph and α∈[0, 1), Nikiforov merged the adjacency matrix and the signless Laplacian matrix to Aα(G)=αD(G)+(1-α)A(G), where D(G), A(G) are the degree diagonal matrix and the adjacency matrix of G, respectively.
WU Yuhao +3 more
doaj +1 more source
A Note on the Spectral Radius of Weighted Signless Laplacian Matrix
Advances in Linear Algebra & Matrix Theory, 2018 A weighted graph is a graph that has a numeric label associated with each edge, called the weight of edge. In many applications, the edge weights are usually represented by nonnegative integers or square matrices. The weighted signless Laplacian matrix of a weighted graph is defined as the sum of adjacency matrix and degree matrix of same weighted ...
KAYA GÖK, GÜLİSTAN +2 more
openaire +3 more sources