Results 61 to 70 of about 1,304 (147)
On the sum of the largest $ A_{\alpha} $-eigenvalues of graphs
AIMS Mathematics, 2022 Let $ A(G) $ and $ D(G) $ be the adjacency matrix and the degree diagonal matrix of a graph $ G $, respectively. For any real number $ \alpha \in[0, 1] $, Nikiforov defined the $ A_{\alpha} $-matrix of a graph $ G $ as $ A_{\alpha}(G) = \alpha D(G)+(1 ...
Zhen Lin
doaj +1 more source
On Some Properties of Characteristics Polynomials of the Complete Graphs Kn [PDF]
Engineering and Technology Journal, 2013 This paper discusses the properties of the characteristic polynomial of the complete graphs Kn, n=1, 2… respective to the adjacency matrices. Two different types of matrices, the adjacency matrix and the signless Laplacian matrix, are presented.
Nuha A. Rajab +2 more
doaj +1 more source
Universal adjacency spectrum of zero divisor graph on the ring and its complement
AKCE International Journal of Graphs and Combinatorics, 2021 For a commutative ring R with unity, the zero divisor graph is an undirected graph with all non-zero zero divisors of R as vertices and two distinct vertices u and v are adjacent if and only if uv = 0. For a simple graph G with the adjacency matrix A and
Saraswati Bajaj, Pratima Panigrahi
doaj +1 more source
On the Signless Laplacian Spectral Radius of Graphs without Small Books and Intersecting Quadrangles
Mathematics, 2022 In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do not contain small books as a subgraph and characterize all extremal graphs. In addition, we give an upper bound of the signless Laplacian spectral radius of
Ming-Zhu Chen +3 more
doaj +1 more source
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
, 2014 Let $G$ be a connected non-bipartite graph on $n$ vertices with domination number $\gamma \le \frac{n+1}{3}$. We investigate the least eigenvalue of the signless Laplacian of $G$, and present a lower bound for such eigenvalue in terms of the domination ...
Fan, Yi-Zheng, Tan, Ying-Ying
core +1 more source
Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number [PDF]
, 2012 In this paper, we present a sharp upper and lower bounds for the signless Laplacian spectral radius of graphs in terms of clique number. Moreover, the extremal graphs which attain the upper and lower bounds are characterized.
Abraham Berman +5 more
core
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
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
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
On maximum signless Laplacian Estrada index of graphs with given parameters II
Electronic Journal of Graph Theory and Applications, 2018 The signless Laplacian Estrada index of a graph G is defined as SLEE(G) = ∑ni = 1eqi where q1, q2, …, qn are the eigenvalues of the signless Laplacian matrix of G.
Ramin Nasiri +3 more
doaj +1 more source