科研之友
微信
新浪微博
Facebook
分享链接
摘要
Given an n-vertex graph G with maximum degree ?, the mixed graph is constructed from G by orienting some of its edges, where G is called the underlying graph of . Let be the H-rank of and let be the independence number of G. In this paper, we firstly determine the maximum nullity of n-vertex mixed graphs with maximum degree ?. The corresponding extremal graphs are identified. We secondly establish upper and lower bounds on , respectively. Finally, we characterize the relationship between the Hermitian energy and the H-rank of a?mixed graph.
