The Signless Laplacian Spectral Radius of Some Special Bipartite Graphs

This paper mainly researches on the signless laplacian spectral radius of bipartite graphs ( ) 1 2 1 2 , ; , r D m m n n . We consider how the signless laplacian spectral radius of ( ) 1 2 1 2 , ; , r D m m n n changes under some special cases. As application, we give two upper bounds on the signless laplacian spectral radius of ( ) 1 2 1 2 , ; , r D m m n n , and determine the graphs that obtain the upper bounds.


Introduction
Let ( ) ( ) ( ) and edge set ( ) E G is considered in this paper.In spectral graph theory, one usually uses the spectrum of related matrices to characterize the structure of graphs.The most studied matrix associated with G appears to be the adjacency matrices ( ) ( ) with 1 ij a = when there's an edge be- tween i v and j v , otherwise 0 ij a = .Some other well studied matrices are the Laplacian matrix and the signless Laplacian matrix of G.The former is defined by ( ) ( ) ( ) is the degree diagonal matrix, whereas the latter is defined as . For polynomials of ( ) , ; , D m m n n .The actical [2] studies the bipartite graph of the fixed order of n and the size of ( ) > , and describes the structure of the bipartite graph with maximum adjacency spectrum radius.Reference [3] is to determine the structure of the bipartite graph of the fixed order of n and the size of m after removing the given k edges.In Reference [4], by studying the signless Laplacian spectrum, the structure of the maximum spectrum of bipartite graphs with fixed order and size is determined, and the upper and lower bounds of the spectrum are given again.
Inspired by the above results, this paper studies the bipartite graph ( ) . We fix the order and the size of the bipartite graphs G, and observe what influence may have on the signless Laplacian radius of G after transforming the neighborhood of some vertexes.
Before giving the main conclusion of this paper, we first introduce the bipartite graph ( ) , ; , r D m m n n , and then give the definitions of equitable division and quotient matrix that need to be used in the later proof: Definition 1.1.Let G be a connected bipartite graph with two vertex sets of U and V, each vertex set has the following partition, showing in Figure 1.If the number of vertexes in 1 2 1 2 , , , , , , m m n n respectively, and the induction sub-graphs of 1 2 1 2 , , , U U V V are all r-regular, then denoting ( ) . For convenience, the order and the size of G are n and m, that is ( ) Figure 1.
( ) are called equitable division of G.
Definition 1.3.Let A as real symmetric matrix, and its row and column are divided equally.The matrix formed by elements that is the average row sum of each sub-blocks, according to the position of its sub-blocks is called the quotient matrix of A. Lemma 1. [5] The spectral radius of G must be the eigenvalue of any quotient matrix of G. Lemma 2. [5] For any graph G, let ( ) , ; , r D m m n n be a connected bipartite graph and defined in definition 1.1, then 1 2 1 2 , , , U U V V is an equitable division.Proof: Because every vertex in 1 U is connected to all vertexes in 2 1 , U V and 2 V , so every vertex of 1 U has the same number of adjacent vertexes in , , U V V .Similarly, every vertex in 2 U has the same number of adjacent ver- texes in 1 1 2 , , U V V , every vertex of 1 V has the same number of adjacent vertexes in 1 2 2 , , U U V , every vertex of 2 V has the same number of adjacent vertexes with 1 2 1 , ,

Regular
In this section, we mainly discuss the graph ( ) , ; , D m m n n , that is, the induction sub-graphs of , , , U U V V are all independent sets and are all 0-regular graphs.For such figure ( ) , ; , D m m n n , we observe the change of the maximum eigenvalue of the graph by taking neighborhood transformation, and then determine the structure of the graph when the graph achieve the maximum spectral radius.Lemma 2.1.Let ( ) ( ) The characteristic polynomials of 1 Q and 2 Q are obtained by calculation as follows: ( ) ( ) ( ) ( ) ) The largest root of , Lemma 3, it's easily to know ( ) ( ) , When

Complete Graph
The induction sub-graphs of ( ) studied in the second section are all independent sets, namely 0-regular graphs.Based on the second section, this section continues to study the situation 1 2 1 2 , , , U U V V that are all com- plete graphs.For convenience, this paper write this graphas ( ) , ; , Y. Yang The characteristic polynomials of 1 Q and 2 Q are obtained by calculation as follows: ( ) ( ) ( ) ( ) ) ) ( ) First of all need to prove ( ) There is a common factor constant a in ( ) f x , and a does not affect the root of ( ) > , so we assume the largest root of ( ) The characteristic polynomials ( ) x with only real roots, let the maximum eigenvalue of the (unsigned) Laplace of graph G is denoted as ( ) G τ , δ and ∆ respectively represent the minimum and maximum de- grees of the graph.The actical[1] studied the bipartite graph ( ) Y. Yang DOI: 10.4236/jamp.2018.6101812160 Journal of Applied Mathematics and Physics order of n and the size of m, and the graph with the largest Laplace spectrum radius in the graph class was determined, as well as the upper bound of the Laplace

3 f
x .Therefore, for the convenience of discussion, we study the polynomial Definition 1.2.Let G be a connected graph, the vertex set ( )