English

On the inertia index of a mixed graph with the matching number

Combinatorics 2019-09-17 v1

Abstract

A mixed graph G~\widetilde{G} is obtained by orienting some edges of GG, where GG is the underlying graph of G~\widetilde{G}. The positive inertia index, denoted by p+(G)p^{+}(G), and the negative inertia index, denoted by n(G)n^{-}(G), of a mixed graph G~\widetilde{G} are the integers specifying the numbers of positive and negative eigenvalues of the Hermitian adjacent matrix of G~\widetilde{G}, respectively. In this paper, we study the positive and negative inertia index of the mixed unicyclic graph. Moreover, we give the upper and lower bounds of the positive and negative inertia index of the mixed graph, and characterize the mixed graphs which attain the upper and lower bounds respectively.

Keywords

Cite

@article{arxiv.1909.07146,
  title  = {On the inertia index of a mixed graph with the matching number},
  author = {Shengjie He and Rong-Xia Hao and Aimei Yu},
  journal= {arXiv preprint arXiv:1909.07146},
  year   = {2019}
}