The characteristic polynomial and the matchings polynomial of a weighted oriented graph

DOI10.1016/j.laa.2011.12.033zbMath1244.05120MaRDI QIDQ417494

Guang-Hui Xu, Shi-Cai Gong

Publication date: 14 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.12.033

zbMATH Keywords

characteristic polynomial; oriented graph; skew symmetric matrix; matchings polynomial; skew adjacency matrix

Mathematics Subject Classification ID

05C31: Graph polynomials

15A18: Eigenvalues, singular values, and eigenvectors

05C20: Directed graphs (digraphs), tournaments

Related Items

On the rank of a real skew symmetric matrix described by an oriented graph, Unnamed Item, On the adjacency matrix of a complex unit gain graph, Skew Randi'c matrix and skew Randi'c energy, Relation between the rank of a signed graph and the rank of its underlying graph, Skew-rank of an oriented graph in terms of matching number, Relation between the skew-rank of an oriented graph and the rank of its underlying graph, Smith normal form and the generalized spectral characterization of oriented graphs, Bicyclic oriented graphs with skew-rank 2 or 4, On the integral weighted oriented unicyclic graphs with minimum skew energy, Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs, On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph, Skew-signings of positive weighted digraphs, Minimal skew energy of oriented unicyclic graphs with fixed diameter, Computing the permanent of the Laplacian matrices of nonbipartite graphs, On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs, On the determinant of the Laplacian matrix of a complex unit gain graph, Bounds for the matching number and cyclomatic number of a signed graph in terms of rank, On oriented graphs whose skew spectral radii do not exceed 2, Classes of graphs with minimum skew rank 4, Skew spectra of graphs without even cycles, Skew-rank of an oriented graph with edge-disjoint cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum rank of skew-symmetric matrices described by a graph
• Matching theory
• Problems in algebraic combinatorics
• Pólya's permanent problem
• Graphical condensation for enumerating perfect matchings
• Permanents, Pfaffian orientations, and even directed circuits
• The skew energy of a digraph
• Skew spectra of oriented graphs
• Theory of monomer-dimer systems
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• On the theory of the matching polynomial
• Matchings and walks in graphs
• The Factorization of Linear Graphs