paper

No mixed graph with the nullity

arXiv:2304.06239

Abstract

A mixed graph is obtained from a simple undirected graph , the underlying graph of , by orienting some edges of . Let be the cyclomatic number of with the number of connected components of , be the matching number of , and be the nullity of . Chen et al. (2018)\cite{LSC} and Tian et al. (2018)\cite{TFL} proved independently that , respectively, and they characterized the mixed graphs with nullity attaining the upper bound and the lower bound. In this paper, we prove that there is no mixed graph with nullity . Moreover, for fixed , there are infinitely many connected mixed graphs with nullity is proved.

No mixed graph with the nullity $η(\widetilde{G})=|V(G)|-2m(G)+2c(G)-1$ · wovepaper