Minimum covering reciprocal distance signless Laplacian energy of graphs (Q2326167): Difference between revisions

The reciprocal transmission \(\mathrm{Tr}^\prime_G(v)\) of a vertex \(v\) of a connected graph \(G\) is defined as \(\displaystyle{\sum_{u\in V(G)}\frac{1}{d_G(u,v)}}, u\neq v\). The reciprocal distance signless Laplacian (RDSL) of a connected graph \(G\) is defined as \(RQ(G)=\operatorname{diag}(\mathrm{Tr}^\prime(G))+RD(G)\), where \(RD(G)\) is the Harary matrix (reciprocal distance matrix) and \(\operatorname{diag}(\mathrm{Tr}^\prime(G))\) is the diagonal matrix of the vertex reciprocal transmissions in \(G\). This paper investigates the RDSL specturm of some classes of graphs. The authors introduce a minimum covering reciprocal distance signless Laplacian matrix (MCRDSL) too. Characterization of extremal graphs with respect to MCRDSL energy of a graph is given. Also some bounds on MCRDSL energy of a graph and spectrial radius of \(G\) is also obtained.