Mixed graphs with H-rank 3
| Autor: | Yi Wang, Chong-Jun Wang, Bo-Jun Yuan, Shuang-Dong Li |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
Numerical Analysis Algebra and Number Theory Clique-sum 010103 numerical & computational mathematics 0102 computer and information sciences 01 natural sciences Metric dimension Combinatorics Indifference graph Pathwidth 010201 computation theory & mathematics Chordal graph Discrete Mathematics and Combinatorics Maximal independent set Cograph Geometry and Topology 0101 mathematics Graph product Mathematics |
| Zdroj: | Linear Algebra and its Applications. 524:22-34 |
| ISSN: | 0024-3795 |
| DOI: | 10.1016/j.laa.2017.02.037 |
| Popis: | In the article (Mohar, 2016 [9] ), Mohar determined all mixed graphs with H-rank 2, and used it to classify cospectral graphs with respect to their Hermitian adjacency matrix, constructing a class of graphs which can not be determined by their H-spectrum. In the present paper, we investigate the H-rank of mixed graphs further, determining the H-ranks of those mixed graphs with trees, cycles and complete bipartite graphs as underlying graphs, respectively. Moreover, we characterize all mixed graphs with H-rank 3, and show that all connected mixed graphs with H-rank 3 can be determined by their H-spectrum. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect