DeepAI AI Chat
Log In Sign Up

On the characteristic polynomial of the A_α-matrix for some operations of graphs

Let G be a graph of order n with adjacency matrix A(G) and diagonal matrix of degree D(G). For every α∈ [0,1], Nikiforov <cit.> defined the matrix A_α(G) = α D(G) + (1-α)A(G). In this paper we present the A_α(G)-characteristic polynomial when G is obtained by coalescing two graphs, and if G is a semi-regular bipartite graph we obtain the A_α-characteristic polynomial of the line graph associated to G. Moreover, if G is a regular graph we exhibit the A_α-characteristic polynomial for the graphs obtained from some operations.


page 1

page 2

page 3

page 4


Many nodal domains in random regular graphs

Let G be a random d-regular graph. We prove that for every constant α > ...

The infinity norm bounds and characteristic polynomial for high order RK matrices

This paper shows that t_m ≤𝐀_∞≤√(t_m) holds, when 𝐀∈ℝ^m × m is a Runge-K...

A weighted graph zeta function involved in the Szegedy walk

We define a new weighted zeta function for a finite graph and obtain its...

Joint estimation of parameters in Ising model

We study joint estimation of the inverse temperature and magnetization p...

X-Ramanujan Graphs

Let X be an infinite graph of bounded degree; e.g., the Cayley graph of ...

The Limiting Eigenvalue Distribution of Iterated k-Regular Graph Cylinders

We explore the limiting empirical eigenvalue distributions arising from ...