Abstract
To discuss the matching uniqueness of the simple undirected graph G. To find the necessary and sufficient conditions for the matching uniqueness of T(a,b,c). Use the maximum real roots, and the properties of matching polynomials to compute. For n≥5, T(1,5,n) and its complement are matching uniqueness if and only if n≠5,8 and 15.
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.
