Abstract
Mohammadian (J Alg Combin 52 (2020), 33-39) defined the Laplacian matching polynomial LG(x) of a simple graph G and obtained many similar properties to the matching polynomial. In this paper, we extend the definition of LG(x) to weighted graphs (vertex-weighted and edge-weighted graphs). Using the principle of inclusion and exclusion, we prove that the Laplacian matching polynomial of a weighted graph G is equivalent to the matching polynomial of a weighted subdivision S(G), which results in a combinatorial explanation of the coefficients of the Laplacian matching polynomial.
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.
