The characteristic polynomial and the matchings polynomial of a weighted oriented graph
DOI10.1016/J.LAA.2011.12.033zbMATH Open1244.05120OpenAlexW2028633282MaRDI QIDQ417494FDOQ417494
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
characteristic polynomialoriented graphskew symmetric matrixmatchings polynomialskew adjacency matrix
Directed graphs (digraphs), tournaments (05C20) Eigenvalues, singular values, and eigenvectors (15A18) Graph polynomials (05C31)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matching theory
- Pólya's permanent problem
- Permanents, Pfaffian orientations, and even directed circuits
- Theory of monomer-dimer systems
- The Factorization of Linear Graphs
- Problems in algebraic combinatorics
- The skew energy of a digraph
- Skew spectra of oriented graphs
- On the theory of the matching polynomial
- Minimum rank of skew-symmetric matrices described by a graph
- Graphical condensation for enumerating perfect matchings
- Matchings and walks in graphs
- Enumeration of perfect matchings of a type of Cartesian products of graphs
Cited In (25)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the permanent of the Laplacian matrices of nonbipartite graphs
- On the characteristic polynomials and \(H\)-ranks of the weighted mixed graphs
- On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
- Bicyclic oriented graphs with skew-rank 2 or 4
- Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
- Relation between the skew-rank of an oriented graph and the rank of its underlying graph
- Skew-rank of an oriented graph in terms of matching number
- Minimal skew energy of oriented unicyclic graphs with fixed diameter
- Skew spectra of graphs without even cycles
- Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Skew-signings of positive weighted digraphs
- On oriented graphs whose skew spectral radii do not exceed 2
- On the rank of a real skew symmetric matrix described by an oriented graph
- Title not available (Why is that?)
- Smith normal form and the generalized spectral characterization of oriented graphs
- Hermitian-Randić matrix and Hermitian-Randić energy of mixed graphs
- Relation between the rank of a signed graph and the rank of its underlying graph
- Skew Randi'c matrix and skew Randi'c energy
- Classes of graphs with minimum skew rank 4
- On the integral weighted oriented unicyclic graphs with minimum skew energy
- Skew-rank of an oriented graph with edge-disjoint cycles
- On the adjacency matrix of a complex unit gain graph
This page was built for publication: The characteristic polynomial and the matchings polynomial of a weighted oriented graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417494)