Block Sombor index of a graph and its matrix representation

1. Introduction

The graph $G=(V,E)$ considered are simple, finite, non-trivial and undirected with $p$-vertices in $V(G)$ and $q$-edges in $E(G)$. The number of vertices adjacent to $v$ is said to be degree of vertex $v$ and is represented as $d_v$. The minimum and the maximum degrees of vertices are represented as $\delta =\delta (G)$ and $\mathrm{\Delta }=\mathrm{\Delta }(G)$, respectively. For the graph theoretic terminology not defined here, we refer to [1].

A vertex whose removal results in a trivial or disconnected graph is said to be the cut vertex. A graph that is connected, non-trivial, and has no cut vertices is said to be a non-separable graph. The maximal non-separable subgraph of a graph is said to be the block of that graph. Two blocks are said to be adjacent if they have a cut vertex in common. The block number $b(G)$ represents the total number of blocks in $G$. The concept of separable graphs play very significant role of Parsimony Haplotyping problem from computational biology, see [2]. For more details, we refer to [3,4,5,6,7].

A graph in which edges represent bonds and vertices represent atoms is said to be a molecular graph. The invariants of the form $\sum _{}f(x,y)$ with the property $f(x,y)=f(y,x)$ are called graphical indices. These are the real numbers derived from the structure of a graph, which are invariant under graph isomorphism. These indices reflect the chemical and physical properties of molecules. Many such invariants have been introduced so far, see [8]. Few of them are as in the Table 1.

Table 1. Graphical indices.

Graphical Index	$f(x,y)=f(d_u,d_v)$ or $f(d_u,b_u)$
Sombor Index $[SO(G)]$ (Gutman [9])	{$\sqrt{d_u^2+d_v^2}$}
First Zagreb Index [$M_1(G)$] (Gutman et al. [10])	{$d_u+d_v$}
Second Zagreb Index [$M_2(G)$] (Gutman et al. [10])	{$d_u.d_v$}
Forgotten Index[$F(G)$] (Furtula and Gutman [11])	{$d_u^2+d_v^2$}
First Atom Valency Block Index [$AV{B}_1(G)$](Chaluvaraju and Vyshnavi  [12])	{$d_u+b_u$}
Second Atom Valency Block Index[$AV{B}_2(G)$] (Chaluvaraju and Vyshnavi  [12])	{$d_u.b_u$}

2. Discussion and Main Results

In this section, we will discuss the concepts: Block Sombor Index, Matrix representation of Block Sombor index and Block Sombor Energy.

2.1. Block Sombor Index

Recently, many graph theorists showed interest in finding some potential mathematical properties and their chemical applicabilities of the sombor index. Inspired by these aspects, we define the Block Sombor index $BS(G)$ of a graph $G$ as $$\begin{array}{}\text{(1)}& BS(G)=BS=\sum _{uv\in E(G)}\sqrt{b_u^2+b_v^2}.\end{array}$$ where $b_u$ represents the number of blocks to which the vertex $u$ belongs to.

Theorem 1. Let $G$ be a separable graph with $k$-cut vertices. Then $$BS(G)=\sum _{i=1}^k\left[(d_{c_i}-\sum _{c_i\sim c_j}1)\sqrt{1+b_{c_i}^2}\right]+\sum _{c_i\sim c_j}\sqrt{b_{c_i}^2+b_{c_j}^2}+(q-\sum _{i=1}^k{d}_{c_i}+\sum _{c_i\sim c_j}1)\sqrt{2}.$$

Proof. Let $G$ be a separable $(p,q)$-graph and $c_1,c_2,\cdots ,c_k$ be the cut vertices of $G$. Let their degrees be $d_{c_1},d_{c_2},\cdots ,d_{c_k}$ and block numbers be $b_{c_1},b_{c_2},\cdots ,b_{c_k}$, respectively. We have the following stages:

Stage 1. Since the cut vertices are adjacent to non-cut vertices and/or cut vertices, number of partitions of the form $(1,b_{c_i})$ is the difference of the degree of the cut vertex and the number of cut vertices adjacent to it.

Stage 2. Since the number of blocks adjacent to each cut vertex varies, number of partitions of the form $(b_{c_i},b_{c_j})$ depends on the adjacencies of cut vertices.

Stage 3. For the non-cut vertices which belong to the same block, the number of partitions of the form $(1,1)$ is difference of total number of edges added to the number of adjacencies of cut vertices and the sum of degrees of all cut vertices.

Formulating these partitions mentioned in three stages, we get the required result.

Corollary 1. Let $G$ be a separable graph. Then,

(i) $BS(G)=(q-d_c)\sqrt{2}+d_c\sqrt{1+b_c^2}$, if $G$ has only one cut vertex.

(ii) $\begin{array}{rl}BS(G)=& (d_{c_1}-1)\sqrt{1+b_{c_1}^2}+(d_{c_2}-1)\sqrt{1+b_{c_2}^2}+\sqrt{b_{c_1}^2+b_{c_2}^2}+(q-d_{c_1}-d_{c_2}+1)\sqrt{2},\end{array}$ if $G$ has two cut vertices.

Theorem 2. Let $G$ be a non-separable graph with $p\ge 2$. Then, $$\begin{array}{}\text{(3)}& BS(G)=\sqrt{2}q.\end{array}$$

Proof. Since the block number of each vertex is exactly one in any non-separable graph $G$. Hence the result follows.

Corollary 2.

(i) For a complete graph $K_p$ with $p\ge 2$, $$BS(K_p)={\displaystyle \frac{p(p-1)}{\sqrt{2}}}.$$

(ii) For a cycle $C_p$ with $p\ge 3$, $$BS(C_p)=\sqrt{2}p.$$

(iii) For a complete bipartite graph $K_{m,n}$ with $2\le m\le n$, $$BS(K_{m,n})=\sqrt{2}mn.$$

(iv) For a generalized Petersen graph $GP(n,t)$, $$GP(n,t)=3\sqrt{2}n,$$

where $GP(n,t)$ is defined to be a graph on $2n$ vertices with $V(GP(n,t))=\{v_i,u_i:0\le i\le n–1\}$ and $E(GP(n,t))=\{v_i{v}_{i+1},v_i{u}_i,u_i{u}_{i+t}:0\le i\le n-1,$ subscripts modulo n$\}$.

(v) For a $n$-hypercube graph $Q_n$ , $$BS(Q_n)=n{2}^{n-1/2},$$ where $Q_n$ also called the $n$-cube graph is a graph whose vertex set $V$, consists of the $2^n$, $n$-dimensional boolean vectors, i.e., vectors with binary coordinates $0$ or $1$, where two vertices are adjacent whenever they differ in exactly one coordinate.

(vi) For a $m\times n$ grid graph $L(m,n)$, $$BS(L(m,n))=\sqrt{2}(2mn-n-m),$$ where the $m\times n$ grid graph can be represented as a cartesian product of $P_m\mathrm{<img\; draggable="false"\; role="img"\; class="emoji"\; alt="◻"\; src="https://s.w.org/images/core/emoji/15.0.3/svg/25fb.svg">}{P}_n$ of a path of length $m-1$ and a path of length $n-1$.

2.1.1 Inequalities

Lemma 1. Let $G$ be a non-trivial connected $(p,q)$-graph. Then

(i) $1\le b_u\le p-1.$ Left inequality holds if and only if $u$ is a non-cut vertex and right inequality holds for a central vertex of a star.

(ii) $b_u\le d_u.$ Equality holds for all vertices in a tree.

Theorem 3. Let $G$ be a non-trivial connected graph. Then $$\sqrt{2}q\le BS(G)\le \sqrt{2}q(p-1).$$ Left inequality holds if and only if $G$ is non-separable.

Proof. Let $G$ be a non-trivial connected graph. By Lemma 1(i), we have $1\le b_u\le p-1$. Therefore squaring up and adding the block numbers of two vertices, we have $2\le b_u^2+b_v^2\le 2(p-1{)}^2$. Also, taking square root of this inequality and adding up them over the number of edges, we have the required inequality. Now, we prove the second part. If the graph $G$ has no cut vertices, then each vertex has block number $b_u=1$ as they belong to exactly one block, which leads to the partition $(1,1)$ for each edge $uv\in E(G)$. Thus we obtain the left equality.

For existence of right equality of the above theorem, we pose the following open problem.
Open Problem. Characterize when $BS(G)=\sqrt{2}q(p-1)?$

Theorem 4. Let $G$ be a non-trivial connected graph. Then $$BS(G)\le SO(G).$$Equality holds if and only if $G$ is a non-trivial tree.

Proof. Let $G$ be a simple connected graph. By Lemma 1(ii), we have $$\begin{array}{rl}BS(G)& =\sum _{uv\in E(G)}\sqrt{b_u^2+b_v^2}\le \sum _{uv\in E(G)}\sqrt{d_u^2+d_v^2}=SO(G).\end{array}$$ Now, we prove the second part. Since each vertex in a non-trivial tree, apart from the pendant vertices is a cut vertex, the block number of each vertex is same as the degree of that vertex. Hence the equality holds.
Conversely, suppose $BS(G)=SO(G)$ holds for a graph which is not a tree. Then there exist at least three vertices such that every pair of vertices are adjacent forming a complete graph. This is a contradiction to our assumption as $BS(K_p)={\displaystyle \frac{p(p-1)}{\sqrt{2}}}$ and $SO(K_p)={\displaystyle \frac{p(p-1{)}^2}{\sqrt{2}}}$. Hence $BS(G)<SO(G)$ if $G$ is not a tree.

In [13], it was proven for a non-trivial connected graph that, $$SO(G)\le {\displaystyle \frac{1}{\sqrt{2}}}(M_1(G)+q(\mathrm{\Delta }-\delta )).$$ From the above and Theorem 4, we obtain the following result:

Corollary 3. Let $G$ be a simple connected graph with $p\ge 2$. Then $$BS(G)\le {\displaystyle \frac{1}{\sqrt{2}}}(M_1(G)+q(\mathrm{\Delta }-\delta )).$$

Theorem 5. Let $G$ be a non-trivial connected graph. Then $$BS(G)\le {\displaystyle \frac{\sqrt{2}{M}_2(G)}{\delta (G)}}.$$

Proof. Let $G$ be a non-trivial connected graph. Then $$\begin{array}{rl}BS(G)& =\sum _{uv\in E(G)}\sqrt{b_u^2+b_v^2}=\sum _{uv\in E(G)}{b}_u{b}_v\sqrt{{\displaystyle \frac{1}{b_u^2}}+{\displaystyle \frac{1}{b_v^2}}}\\ & \le \sum _{uv\in E(G)}{d}_u{d}_v\sqrt{{\displaystyle \frac{1}{{\delta }^2}}+{\displaystyle \frac{1}{{\delta }^2}}}\\ & ={\displaystyle \frac{\sqrt{2}{M}_2(G)}{\delta (G)}}.\end{array}$$

Theorem 6. Let $G$ be a non-trivial connected graph. Then $$BS(G)\le \sqrt{qF(G)}.$$

Proof. Let $G$ be a non-trivial connected graph. Then $$\begin{array}{rl}BS(G)& =\sum _{uv\in E(G)}\sqrt{b_u^2+b_v^2}=\sum _{uv\in E(G)}1.\sqrt{b_u^2+b_v^2}\\ & \le \sqrt{\sum _{uv\in E(G)}{1}^2.\sum _{uv\in E(G)}(d_u^2+d_v^2)}=\sqrt{qF(G)}.\end{array}$$

In [14], it was proven for a non-trivial connected graph that, $$F(G)\le (\mathrm{\Delta }+\delta )M_1(G)-2q\mathrm{\Delta }\delta .$$ From the above and Theorem 6, we obtain the following result:

Corollary 4. Let $G$ be a simple connected graph with $p\ge 2$. Then $$BS(G)\le \sqrt{q[(\mathrm{\Delta }+\delta )M_1(G)-2q\mathrm{\Delta }\delta ]}.$$

In [15], it was proven for a non-trivial connected graph that, $$F(G)\le \mathrm{\Delta }{M}_1(G)-{\displaystyle \frac{(2q\mathrm{\Delta }-M_1(G){)}^2}{n\mathrm{\Delta }-2q}}.$$ From the above and Theorem 6, we obtain the following result:

Corollary 5. Let $G$ be a simple connected graph. Then $$BS(G)\le \sqrt{q[\mathrm{\Delta }{M}_1(G)-{\displaystyle \frac{(2q\mathrm{\Delta }-M_1(G){)}^2}{n\mathrm{\Delta }-2q}}]}.$$

Theorem 7. Let $G$ be a connected regular graph with $p\ge 2$. Then $$BS(G)\le {\displaystyle \frac{\sqrt{2}AV{B}_2(G)}{\delta (G)}}.$$

Proof.Let $G$ be a $(p,q)$-regular graph with $p\ge 2$. Then $$\begin{array}{rl}BS(G)& =\sum _{uv\in E(G)}\sqrt{b_u^2+b_v^2}=\sum _{uv\in E(G)}{b}_u{b}_v\sqrt{{\displaystyle \frac{1}{b_u^2}}+{\displaystyle \frac{1}{b_v^2}}}\\ & \le \sum _{uv\in E(G)}{b}_u{d}_u\sqrt{{\displaystyle \frac{1}{{\delta }^2}}+{\displaystyle \frac{1}{{\delta }^2}}}\\ & ={\displaystyle \frac{\sqrt{2}AV{B}_2(G)}{\delta (G)}}.\end{array}$$

In [12], it was proven for a non-trivial connected graph that, $$AV{B}_2(G)\le {\displaystyle \frac{1}{4}}AV{B}_1(G{)}^2.$$ From the above and Theorem 7, we obtain the following result:

Corollary 6. Let $G$ be a simple connected graph with $p\ge 2$. Then $$BS(G)\le {\displaystyle \frac{AV{B}_1(G{)}^2}{2\sqrt{2}\delta (G)}}.$$

2.2. Matrix representation of Block Sombor index

The spectral graph theory including the concept of graph energy plays a good role in analyzing the matrices. For more details we refer to [16,17,18,19,20,21,22,23,24,25,26]. The Adjacency matrix $A(G)=A=[a_{ij}{]}_{p\times p}$ of a graph $G$ with vertex set $V(G)=\{v_1,v_2,\cdots ,v_p\}$ is the symmetric matrix whose elements are, $$\begin{array}{r}{a}_{ij}=\{\begin{array}{l}1,if{v}_i{v}_j\in E(G)\\ 0,otherwise.\end{array}\end{array}$$ The energy $E_A(G)=E_A$ of a graph $G$ is the sum of all absolute eigen values of the adjacency matrix $A$. Anologously, we define the Block Sombor Matrix $A_{BS}(G)=A_{BS}=[b{s}_{ij}{]}_{p\times p}$ of the graph $G$ as the symmetric matrix of order $p$, whose elements are $$\begin{array}{r}b{s}_{ij}=\{\begin{array}{l}\sqrt{b_{v_i}^2+b_{v_j}^2},v_i{v}_j\in E(G)\\ 0,otherwise.\end{array}\end{array}$$ The characteristic polynomial is influential aspect of spectral graph theory, due to its algebraic construction, which has massive graphical information. For this purpose, we define the following: The Block Sombor polynomial of a graph $G$ is defined as $P_{BS}(G,\lambda )=det(\lambda I-A_{BS})$, where $I$ is a $p\times p$ unit matrix. As $A_{BS}$ is a real symmetric matrix, all roots of ${\varphi }_{BS}(G,\lambda )=0$ are real. Therefore, they can be arranged in order as ${\lambda }_1\ge {\lambda }_2\ge {\lambda }_3\cdots \ge {\lambda }_p$, where ${\lambda }_1$ is said to be spectral radius of $A_{BS}$.

Lemma 2. Let ${\lambda }_1\ge {\lambda }_2\ge \cdots \ge {\lambda }_p$ be the eigen values of $A_{BS}$. Then

(i) $\sum _{i=1}^p{\lambda }_i=0$.

(ii) $\sum _{i=1}^p{\lambda }_i^2\le 2F(G)$.

Equality holds if and only if $G$ is a non-trivial tree.

Proof.Let ${\lambda }_1\ge {\lambda }_2\ge {\lambda }_3\cdots \ge {\lambda }_p$ be the eigen values of $A_{BS}$.

(i) If the sum of all the eigen values counted with multiplicities is the trace of the matrix, then the principal diagonal elements of $A_{BS}$ are all zeroes. Hence the trace is zero. Thus the result.

(ii) If $\{v_1,v_2,\cdots ,v_p\}$ is the set of vertices of $G$, then $$\begin{array}{rl}\sum _{i=1}^p{\lambda }_i^2& =tr(A_{BS}^2)=\sum _{i=1}^p\sum _{j=1}^p{A}_{BS}(v_i,v_j)A_{BS}(v_j,v_i)\\ & =2\sum _{v_i{v}_j\in E(G)}{A}_{BS}(v_i,v_j)A_{BS}(v_j,v_i)\\ & =2\sum _{v_i{v}_j\in E(G)}{b}_{v_i}^2+b_{v_j}^2\\ & \le 2\sum _{v_i{v}_j\in E(G)}{d}_{v_i}^2+d_{v_j}^2=2F(G).\end{array}$$ Now, we prove the second part of (ii).

Since each vertex in a non-trivial tree, other than the pendant vertices is a cut vertex, the block number of each vertex is same as the degree of that vertex. Hence the equality holds. Conversely, suppose $G$ is not a tree but $\sum _{i=1}^p{\lambda }_i^2=2F(G)$ holds. Then there exist at least three vertices such that every pair of vertices are adjacent forming a complete graph. This is a contradiction to our assumption because in a complete graph, $\sum _{i=1}^p{\lambda }_i^2=2p(p-1)$ and $F(K_p)=2q(p-1{)}^2$. Hence $\sum _{i=1}^p{\lambda }_i^2<2F(G)$ if $G$ is not a tree.

Hence the proof.

Theorem 8. Let $G$ be any non-trivial connected $(p,q)$-graph. Then, $${\lambda }_1\le \sqrt{{\displaystyle \frac{2(p-1)}{(p-2)}}F(G)}.$$

Proof.Let $G$ be non-trivial connected $(p,q)$-graph. Then, taking $a_i={\lambda }_i$ and $b_i=1$ for $i=1,2,\cdots ,p$ in Cauchy-Schwarz inequality, we get, $$\begin{array}{rl}{\left(\sum _{i=2}^p{\lambda }_i\right)}^2& \le (p-1)\sum _{i=2}^p{\lambda }_i^2.\\ ⟹{\left(\sum _{i=2}^p{\lambda }_i\right)}^2-{\lambda }_1^2& \le (p-1)[\sum _{i=2}^p{\lambda }_i^2-{\lambda }_1^2].\end{array}$$ Solving this, we get the required inequality.

2.3. Block Sombor Energy

The Block Sombor Energy of a graph $G$ is defined as, $$E_{BS}=\sum _{i=1}^p|{\lambda }_i|=\sum _{i=1}^p{\sigma }_i,$$ where ${\sigma }_1\ge {\sigma }_2\ge {\sigma }_3\ge \cdots \ge {\sigma }_p$ are the absolute values of ${\lambda }_i$.

Lemma 3. [27] Consider a class of real polynomials $\mathcal{P}(a_1,a_2)$, of the form $$P_n(x)=x^n+a_1{x}^{n-1}+a_2{x}^{n-2}+b_3{x}^{n-3}+\cdots +b_n,$$ where $a_1$ and $a_2$ are given real numbers. Let $x_1\ge x_2\ge \cdots \ge x_n$ be roots of $P_n(x)\in \mathcal{P}(a_1,a_2)$. Then, $$\begin{array}{}\text{(3)}& \overline{x}+{\displaystyle \frac{1}{n}}\sqrt{{\displaystyle \frac{\theta }{n-1}}}& \le x_1\le \overline{x}+{\displaystyle \frac{1}{n}}\sqrt{\theta (n-1)},\text{(4)}& \overline{x}+{\displaystyle \frac{1}{n}}\sqrt{{\displaystyle \frac{\theta (i-1)}{n-i+1}}}& \le x_i\le \overline{x}+{\displaystyle \frac{1}{n}}\sqrt{{\displaystyle \frac{\theta (n-i)}{i}}};i=2,3,\cdots ,n-1,\text{(5)}& \overline{x}-{\displaystyle \frac{1}{n}}\sqrt{\theta (n-1)}& \le x_n\le \overline{x}-{\displaystyle \frac{1}{n}}\sqrt{{\displaystyle \frac{\theta }{n-1}}},\end{array}$$ where $\overline{x}={\displaystyle \frac{1}{n}}\sum _{i=1}^n{x}_i$ and $\theta =n\sum _{i=1}^n{x}_i^2–{\left(\sum _{i=1}^n{x}_i\right)}^2$.

Lemma 4. The following inequalities hold for ${\sigma }_1\ge {\sigma }_2\ge \cdots \ge {\sigma }_p$ $$\begin{array}{rl}& {\displaystyle \frac{E_{BS}}{p}}+{\displaystyle \frac{1}{p}}\sqrt{{\displaystyle \frac{ptr(A_{BS}^2)-E_{BS}^2}{p-1}}}\le {\sigma }_1\le {\displaystyle \frac{E_{BS}}{p}}+{\displaystyle \frac{1}{p}}\sqrt{(p-1)(ptr(A_{BS}^2)-E_{BS}^2)},\\ & {\displaystyle \frac{E_{BS}}{p}}+{\displaystyle \frac{1}{p}}\sqrt{{\displaystyle \frac{(i-1)[ptr(A_{BS}^2)-E_{BS}^2]}{p-i+1}}}\le {\sigma }_i\le {\displaystyle \frac{E_{BS}}{p}}+{\displaystyle \frac{1}{p}}\sqrt{{\displaystyle \frac{(p-i)[ptr(A_{BS}^2)-E_{BS}^2]}{i}}};i=2,3,\cdots ,p-1,\\ & {\displaystyle \frac{E_{BS}}{p}}-{\displaystyle \frac{1}{p}}\sqrt{(p-1)(ptr(A_{BS}^2)-E_{BS}^2)}\le {\sigma }_p\le {\displaystyle \frac{E_{BS}}{p}}-{\displaystyle \frac{1}{p}}\sqrt{{\displaystyle \frac{ptr(A_{BS}^2)-E_{BS}^2}{p-1}}}.\end{array}$$

Proof. Consider the polynomial, $$P_p(x)=\prod _{i=1}^p(x-{\sigma }_i)=x^p+a_1{x}^{p-1}+a_2{x}^{p-2}+b_3{x}^{p-3}+\cdots +b_p.$$ Since $a_1=-\sum _{i=1}^p{\sigma }_i=-E_{BS}$ and $a_2=\frac{1}{2}({\left(\sum _{i=1}^p{\sigma }_i\right)}^2–\sum _{i=1}^p{\sigma }_i^2)=\frac{1}{2}[E_{BS}^2-tr(A_{BS}{)}^2],$ polynomial $P_p(x)$ belongs to the class of real polynomials of the form $\mathcal{P}(-E_{BS},\frac{1}{2}{E}_{BS}^2-\frac{1}{2}tr(A_{BS}{)}^2)$.
By Lemma 3, we have, $$\begin{array}{rl}\overline{x}& ={\displaystyle \frac{1}{p}}\sum _{i=1}^p{\sigma }_i={\displaystyle \frac{E_{BS}}{p}}.\\ \theta & =p\sum _{i=1}^p{\sigma }_i^2–{\left(\sum _{i=1}^p{\sigma }_i\right)}^2=ptr(A_{BS}^2)-E_{BS}^2.\end{array}$$ Substituting these in inequalities ($\text{3}$), ($\text{4}$) and ($\text{5}$), we get the required results.

Theorem 9. Let $G$ be a connected $(p,q)$-graph with $p\ge 2$. Then $$E_{BS}\le k+\sqrt{(p-1)(tr(A_{BS}^2)-k^2)},$$ for any real number $k$ with the property ${\sigma }_1\ge k\ge {\sigma }_p$.

Proof. By Lemma 4, we have $$\begin{array}{rl}& k\le {\sigma }_1\le {\displaystyle \frac{E_{BS}}{p}}+{\displaystyle \frac{1}{p}}\sqrt{(p-1)(ptr(A_{BS}^2)-E_{BS}^2)}\\ & ⟹(pk-E_{BS}{)}^2\le (p-1)ptr(A_{BS}^2)-p{E}_{BS}^2+E_{BS}^2\\ & ⟹p^2{k}^2+E_{BS}^2-2pk{E}_{BS}+p{E}_{BS}^2-E_{BS}^2\le (p-1)ptr(A_{BS}^2)\\ & ⟹(E_{BS}-k{)}^2\le (p-1)tr(A_{BS}^2)-(p-1)k^2\\ & ⟹E_{BS}\le k+\sqrt{(p-1)(tr(A_{BS}^2)-k^2)}.\end{array}$$

By Lemma 4 and Theorem 9, we have the following result:

Corollary 7. Let $G$ be a $(p,q)$-graph with $p\ge 2$. Then, $$E_{BS}\le min\{{\sigma }_1+\sqrt{(p-1)tr(A_{BS}^2)-{\sigma }_1^2)},{\sigma }_p+\sqrt{(p-1)tr(A_{BS}^2)-{\sigma }_p^2)}\}.$$

Corollary 8. Let $G$ be a $(p,q)$-graph with $p\ge 2$. Then,$$E_{BS}\le \sqrt{2pF(G)}.$$

Proof. For $k=\sqrt{{\displaystyle \frac{tr(A_{BS}^2)}{p}}}$, ${\sigma }_1\ge \sqrt{{\displaystyle \frac{tr(A_{BS}^2)}{p}}}\ge {\sigma }_p$, by Theorem 9, we have, $$\begin{array}{rl}{E}_{BS}& \le \sqrt{{\displaystyle \frac{tr(A_{BS}^2)}{p}}}+\sqrt{(p-1)[tr(A_{BS}^2)-{\displaystyle \frac{tr(A_{BS}^2)}{p}}]}\\ & =\sqrt{{\displaystyle \frac{tr(A_{BS}^2)}{p}}}+\sqrt{{\displaystyle \frac{(p-1{)}^2}{p}}tr(A_{BS}^2)}\\ & =p\sqrt{{\displaystyle \frac{tr(A_{BS}^2)}{p}}}\le \sqrt{2pF(G)}.\end{array}$$

Lemma 5.[28] For a sequence of non-negative real numbers $b_1\ge b_2\ge \cdots \ge b_n\ge 0,$ $$\begin{array}{}\text{(7)}& \sum _{i=1}^n{b}_i+n(n-1){\left(\prod _{i=1}^n{b}_i\right)}^{\frac{1}{n}}\le {\left(\sum _{i=1}^n\sqrt{b_i}\right)}^2\le (n-1)\sum _{i=1}^n{b}_i+n{\left(\prod _{i=1}^n{b}_i\right)}^{\frac{1}{n}}.\end{array}$$

Theorem 10. Let $G$ be a (p,q)-graph with $p\ge 2$. Then $$\sqrt{tr(A_{BS}^2)+p(p-1)(|detA|{)}^{\frac{2}{p}}}\le E_{BS}\le \sqrt{(p-1)tr(A_{BS}^2)+p(|detA|{)}^{\frac{2}{p}}}.$$

Proof. Substituting $b_i={\sigma }_i^2(i=1,2,\cdots ,p),$ in equation $\text{7}$ of Lemma 5, we obtain $$\begin{array}{r}\sum _{i=1}^p{\sigma }_i^2+p(p-1){\left(\prod _{i=1}^p\sigma i^2\right)}^{\frac{1}{p}}\le {\left(\sum _{i=1}^p\sqrt{\sigma i^2}\right)}^2\le (p-1)\sum _{i=1}^p\sigma i^2+p{\left(\prod _{i=1}^p\sigma i^2\right)}^{\frac{1}{p}}.\end{array}$$ $$⟹tr(A_{BS}^2)+p(p-1)(|detA|{)}^{\frac{2}{p}}\le E_{BS}^2\le (p-1)tr(A_{BS}^2)+p(|detA|{)}^{\frac{2}{p}}.$$ Thus, we obtain the above inequality.

Theorem 11. Let $G$ be a (p,q)-graph with $p\ge 2$. Then $$\sqrt{2tr(A_{BS}^2)}\le E_{BS}\le \sqrt{ptr(A_{BS}^2)}.$$ Left equality holds if and only if ${\lambda }_1=-{\lambda }_p,{\lambda }_2={\lambda }_3=\cdots ={\lambda }_{p-1}=0$. Right equality holds if and only if ${\sigma }_1={\sigma }_2=\cdots ={\sigma }_p$.

Proof. We have, $${\left(\sum _{i=1}^p\lambda i\right)}^2=0=\sum _{i=1}^p\lambda i^2+2\sum _{i<j}{\lambda }_i{\lambda }_j.$$ Thus, $$\sum _{i=1}^p{\lambda }_i^2=-2\sum _{i<j}{\lambda }_i{\lambda }_j=2\left|\sum _{i<j}{\lambda }_i{\lambda }_j\right|.$$ Therefore, $$\begin{array}{rl}{E}_{BS}^2& ={\left(\sum _{i=1}^p\left|\lambda i\right|\right)}^2=\sum _{i=1}^p{\left|\lambda i\right|}^2+2\sum _{i<j}\left|{\lambda }_i\right|\left|{\lambda }_j\right|\\ & \ge \sum _{i=1}^p{\left|\lambda i\right|}^2+2\left|\sum _{i<j}{\lambda }_i{\lambda }_j\right|=2\sum _{i=1}^p{\left|\lambda i\right|}^2=2tr(A_{BS}^2).\end{array}$$ Thus the left inequality is proved. The equality holds if and only if $\sum _{i<j}\left|{\lambda }_i\right|\left|{\lambda }_j\right|=\left|\sum _{i<j}{\lambda }_i{\lambda }_j\right|$, that is when ${\lambda }_1=-{\lambda }_p,{\lambda }_2={\lambda }_3=\cdots ={\lambda }_{p-1}=0$. The Lagrange's identity says, for $(a)=(a_1,a_2,\cdots ,a_n)$ and $(b)=(b_1,b_2,\cdots ,b_n)$, the two sets of real numbers, $$\sum _{i=1}^n{a}_i^2\sum _{i=1}^n{b}_i^2-{\left(\sum _{i=1}^n{a}_i{b}_i\right)}^2=\sum _{1\le i<j\le n}(a_i{b}_j-a_j{b}_i{)}^2.$$ Substituting $a_i=\sigma i,b_i=1,(i=1,2,\cdots ,p)$ in the above identity, we get, $$\begin{array}{r}p\sum _{i=1}^p{\sigma }_i^2-{\left(\sum _{i=1}^p\sigma i\right)}^2=\sum _{1\le i<j\le p}({\sigma }_i-{\sigma }_j{)}^2.\end{array}$$ $\sum _{1\le i<j\le p}({\sigma }_i-{\sigma }_j{)}^2\ge 0$ with equality if and only if ${\sigma }_1={\sigma }_2=\cdots ={\sigma }_p$. Thus we have, $$\begin{array}{r}p\sum _{i=1}^p{\sigma }_i^2-{\left(\sum _{i=1}^p\sigma i\right)}^2\ge 0⟹ptr(A_{BS}^2)\ge E_{BS}^2.\end{array}$$ Thus the right inequality is obtained.

Corollary 9. Let $G$ be a (p,q)-graph with $p\ge 2$. If $\sqrt{b_u^2+b_v^2}\ge c>0,$ then $$2c\sqrt{q}\le 2\sqrt{cBS(G)}\le E_{BS}.$$

Theorem 12. For any connected $(p,q)$-graph with $p\ge 2$, $${\displaystyle \frac{\sqrt{2}}{(p-1)}}BS(G)\le E_A(G)\le {(\sqrt{2}pBS(G))}^{\frac{1}{2}}.$$

Proof. Let $G$ be a connected $(p,q)$-graph with $p\ge 2$.
By Theorem 3, we have $$\begin{array}{}\text{(8)}& q\le {\displaystyle \frac{BS(G)}{\sqrt{2}}}andq\ge {\displaystyle \frac{BS(G)}{\sqrt{2}(p-1)}}.\end{array}$$ McClelland inequality is $E_A(G)\le \sqrt{2pq}$. Thus from first inequality of ($\text{8}$) and McClelland inequality, we have the required left inequality. Also, the required right inequality follows from the second inequality of ($\text{8}$).

3. Conclusion

Spectral graph theory has a wide variety of applications in many computational sciences. In view of the above fact, here, we discussed the properties, bounds and characterizations of the newly introduced Block Sombor Index and its Matrix representation along with Block Sombor Energy and Spectral radius of a graph.

Author Contributions:

All authors contributed equally to the writing of this paper. All authors read and approved the final manuscript.

Conflicts of Interest:

“The authors declare no conflict of interest.”