Degree Square Sum Energy of Graphs


Abstract views: 95 / PDF downloads: 99

Authors

  • B. Basavanagoud Department of Mathematics, Karnatak University, Dharwad, Karnataka, India
  • E. Chitra Department of Mathematics, Karnatak University, Dharwad, Karnataka, India

Keywords:

Degree square sum matrix, degree square sum polynomial, Eigenvalues, Graph operations

Abstract

Degree square sum matrix $DSS(G)$ of a graph $G$ is a square matrix of order equal to the order of $G$ with its $(i,j)^{th}$ entry as ${{d_i}^{2}+{d_j}^{2}}$ if $i\neq j$ and zero otherwise, where $d_i$ is the degree of the $i^{th}$ vertex of $G$. In this paper, we obtain the characteristic polynomial of the degree square sum matrix of graphs obtained by some graph operations. In addition, bounds for largest degree square sum eigenvalue and for degree square sum energy of graphs are obtained.

Downloads

Published

15-06-2018

How to Cite

B. Basavanagoud, & E. Chitra. (2018). Degree Square Sum Energy of Graphs. International Journal of Mathematics And Its Applications, 6(2 - B), 193–205. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/716

Issue

Section

Research Article