Let be a mixed graph and be its Hermitian-adjacency matrix. If we add every edge and arc in a Randi'c 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'c matrix of a mixed graph , where () if is an arc of , if is an undirected edge of , and otherwise. In this paper, firstly, we compute the characteristic polynomial of the Hermitian-Randi'c matrix of a mixed graph. Furthermore, we give bounds to the Hermitian-Randi'c energy of a general mixed graph. Finally, we give some results about the Hermitian-Randi'c energy of mixed trees.

生成讲解博客的中文版本

生成AI智能校验的中文版本