On the inertia index of a mixed graph in terms of the matching number
From MaRDI portal
Publication:6173973
DOI10.1007/s10255-023-1061-8zbMath1518.05042arXiv1909.07146MaRDI QIDQ6173973
Ai-Mei Yu, Shengjie He, Rong-xia Hao
Publication date: 13 July 2023
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.07146
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C09: Graphical indices (Wiener index, Zagreb index, Randi? index, etc.)
Related Items
Cites Work
- Unnamed Item
- Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Bounds for the positive and negative inertia index of a graph
- Mixed graphs with \(H\)-rank 3
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- The inertia of unicyclic graphs and the implications for closed-shells
- Positive and negative inertia index of a graph
- Relations between the inertia indices of a mixed graph and those of its underlying graph
- Characterizing the mixed graphs with exactly one positive eigenvalue and its application to mixed graphs determined by their \(H\)-spectra
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
- Large regular bipartite graphs with median eigenvalue 1
- On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
- On the nullity of graphs with pendant trees
- Skew-rank of an oriented graph in terms of matching number
- The extremal graphs with respect to their nullity
