Skew-adjacency matrices of graphs

作     者：Cavers, M. Cioaba, S. M. Fallat, S. Gregory, D. A. Haemers, W. H. Kirkland, S. J. McDonald, J. J. Tsatsomeros, M. 

作者机构：Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada Univ Calgary Dept Math & Stat Calgary AB T2N 1N4 Canada Univ Delaware Dept Math Sci Newark DE 19716 USA Univ Regina Dept Math & Stat Regina SK S4S 0A2 Canada Tilburg Univ Dept Econometr & Oper Res NL-5000 LE Tilburg Netherlands Natl Univ Ireland Maynooth Hamilton Inst Maynooth Kildare Ireland Washington State Univ Dept Math Pullman WA 99164 USA 

出 版 物：《LINEAR ALGEBRA AND ITS APPLICATIONS》 (线性代数及其应用)

年 卷 期：2012年第436卷第12期

页      面：4512-4529页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Skew-adjacency matrices Graph spectra Odd-cycle graphs Matchings polynomials Pfaffians 

摘      要：The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral: relations between the matchings polynomial of a graph and the characteristic polynomials of its adjacency and skew-adjacency matrices;skew-spectral radii and an analogue of the Perron-Frobenius theorem;and the number of skew-adjacency matrices of a graph with distinct spectra. (C) 2012 Elsevier Inc. All rights reserved.