Abstract
The matching polynomials and permanental polynomials have been investigated extensively, but no investigations focus on the relations between them. In this paper, we establish first two equalities on the signless matching polynomial and signless permanental polynomials. Then we show that the number of perfect matchings of a graph is the mean value of the permanents of skew-adjacency matrices. Moreover, we find that the matching polynomial of a graph is the expectation of skew-permanental polynomials of orientation graphs. Finally, we derive that the variance of the permanents of skew-adjacency matrices of orientation graphs can be expressed in terms of the number of matching alternating cycles in a graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
