On the matching arrangement of a graph and properties of its characteristic polynomial
From MaRDI portal
(Redirected from Publication:6647129)
On the matching arrangement of a graph and properties of its characteristic polynomial (scientific article; zbMATH DE number 7952755)
On the matching arrangement of a graph and properties of its characteristic polynomial (scientific article; zbMATH DE number 7952755)
Recommendations
- Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $\mathcal{J}_n$
- Matching polynomials: A matrix approach and its applications
- On the character of the matching polynomial and its application to circuit characterization of graphs
- The characteristic polynomials of the graphical arrangements corresponding to simply-connected polygons
- Matchings and walks in graphs
Cites work
- Abstract Linear Dependence and Lattices
- An introduction to hyperplane arrangements
- Arrangements of hyperplanes and the number of threshold functions
- Asymptotics of the number of threshold functions and the singularity probability of random \( \{\pm 1\}\)-matrices
- Bounds for the number of threshold functions
- Congruent graphs and the connectivity of graphs
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
Cited in
(1)
This page was built for publication: On the matching arrangement of a graph and properties of its characteristic polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647129)
