Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs

preprint2016arXivOpen access

Abstract

Let MM be a mixed graph and H(M)H(M) be its Hermitian-adjacency matrix. If we add every edge and arc in MM a Randić weight, then we can get a new weighted Hermitian-adjacency matrix. What are the properties of this new matrix? Motivated by this, we define the Hermitian-Randić matrix RH(M)=(rh)klR_{H}(M)=(r_{h})_{kl} of a mixed graph MM, where (rh)kl=−(rh)lk=idkdl(r_{h})_{kl}=-(r_{h})_{lk}=\frac{\textbf{i}}{\sqrt{d_{k}d_{l}}} (i=−1\textbf{i}=\sqrt{-1}) if (vk,vl)(v_{k},v_{l}) is an arc of MM, (rh)kl=(rh)lk=1dkdl(r_{h})_{kl}=(r_{h})_{lk}=\frac{1}{\sqrt{d_{k}d_{l}}} if vkvlv_{k}v_{l} is an undirected edge of MM, and (rh)kl=0(r_{h})_{kl}=0 otherwise. In this paper, firstly, we compute the characteristic polynomial of the Hermitian-Randić matrix of a mixed graph. Furthermore, we give bounds to the Hermitian-Randić energy of a general mixed graph. Finally, we give some results about the Hermitian-Randić energy of mixed trees.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.