Let G be a simple connected graph. In this paper, we study the spectral properties of the generalized distance matrix of graphs, the convex combination of the symmetric distance matrix and diagonal matrix of the vertex transmissions . We determine the spectrum of the join of two graphs and of the join of a regular graph with another graph, which is the union of two different regular graphs. Moreover, thanks to the symmetry of the matrices involved, we study the generalized distance spectrum of the graphs obtained by generalization of the join graph operation through their eigenvalues of adjacency matrices and some auxiliary matrices.
12 March 2018 in Bulletin of the Malaysian Mathematical Sciences Society
Let G be a simple connected graph with n vertices, m edges and having distance signless Laplacian eigenvalues . For , let and be respectively the sum of k-largest distance signless Laplacian eigenvalues and the sum of k-smallest distance signless Laplacian eigenvalues of G. In this paper, we obtain the bounds for and in terms of the number of vertices n and the transmission of the graph G. We propose a Brouwer-type conjecture for and show that it holds for graphs of diameter one and graphs of diameter two for all k. As a consequence, we observe that the conjecture holds for threshold graphs and split graphs (of diameter two). We also show that it holds for k = n−1 and n for all graphs and for some k for r-transmission regular graphs.
The generalized distance matrix of a connected graph G is defined as , where , is the distance matrix and is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy . Some new upper and lower bounds for the generalized distance energy of G are established based on parameters including the Wiener index and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.
6 September 2020 in Linear and Multilinear Algebra
For a simple connected graph G, let , , and , respectively, are the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix. The generalized distance matrix of G is the convex linear combinations of and and is defined as , for . As and , this matrix reduces to merging the distance spectral and distance signless Laplacian spectral theories. Let be the eigenvalues of and let be the generalized distance spectral spread of the graph G. In this paper, we obtain bounds for the generalized distance spectral spread . We also obtain a relation between the generalized distance spectral spread and the distance spectral spread . Further, we obtain lower bounds for of bipartite graphs involving different graph parameters and we characterize the extremal graphs for some cases. We also obtain lower bounds for in terms of clique number and independence number of the graph G and characterize the extremal graphs for some cases.