Abstract
An investigation is made into graphs which have the same number of k-matchings, for all values of k (i.e. matching equivalent graphs). Some general constructions are presented. The results are then applied to the construction of chessboards which have the same rook polynomial (i.e. rook equivalent chessboards). This novel approach to problems on equivalence of chessboards (using the matching polynomial) seems to have some potential in the study of rook polynomials and, in general, permutations with restricted positions.
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.
