Abstract
Let be a mixed graph and be its Hermitian-adjacency matrix. If we add every edge and arc in 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 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ć 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.