Mixed graphs with cut vertices having exactly two positive eigenvalues
Combinatorics
2021-02-23 v1
Abstract
A mixed graph is obtained by orienting some edges of a simple graph. The positive inertia index of a mixed graph is defined as the number of positive eigenvalues of its Hermitian adjacency matrix, including multiplicities. This matrix was introduced by Liu and Li, independently by Guo and Mohar, in the study of graph energy. Recently, Yuan et al. characterized the mixed graphs with exactly one positive eigenvalue. In this paper, we study the positive inertia indices of mixed graphs and characterize the mixed graphs with cut vertices having positive inertia index 2.
Cite
@article{arxiv.2102.10841,
title = {Mixed graphs with cut vertices having exactly two positive eigenvalues},
author = {Xiaocong He and Lihua Feng},
journal= {arXiv preprint arXiv:2102.10841},
year = {2021}
}
Comments
26 pages, 4 figures