Results 61 to 70 of about 960 (155)
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
The extremal spectral radii of $k$-uniform supertrees
, 2014 In this paper, we study some extremal problems of three kinds of spectral radii of $k$-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $Q$-spectral radius). We call a connected and acyclic $k$
Li, Honghai, Qi, Liqun, Shao, Jiayu
core +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
Merging the A- and Q-spectral theories
, 2016 Let $G$ be a graph with adjacency matrix $A\left( G\right) $, and let $D\left( G\right) $ be the diagonal matrix of the degrees of $G.$ The signless Laplacian $Q\left( G\right) $ of $G$ is defined as $Q\left( G\right) :=A\left( G\right) +D\left( G\right)
Nikiforov, V.
core +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
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
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +1 more source
, 2015 Let $\mathcal{A(}G\mathcal{)},\mathcal{L(}G\mathcal{)}$ and $\mathcal{Q(}% G\mathcal{)}$ be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph $G$, respectively.
Qi, Liqun, Shao, Jiayu, Yuan, Xiying
core +1 more source
The Largest Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter
Journal of Applied Mathematics, Volume 2013, Issue 1, 2013., 2013 We identify graphs with the maximal Laplacian spectral radius among all unicyclic graphs with n vertices and diameter d.
Haixia Zhang, Baolin Wang
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