Hermitian-Randi\'c matrix and Hermitian-Randi\'c energy of mixed graphs
Abstract
Let M be a mixed graph and H(M) be its Hermitian-adjacency matrix. If we add every edge and arc in M 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 RH(M)=(rh)kl of a mixed graph M, where (rh)kl=-(rh)lk=idkdl (i=-1) if (vk,vl) is an arc of M, (rh)kl=(rh)lk=1dkdl if vkvl is an undirected edge of M, and (rh)kl=0 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.