Abstract
Let G be a graph, and let A ( G ) be the adjacency matrix of G. The computation of permanent of A ( G ) is #p-complete. Computing permanent of A ( G ) is of great interest in quantum chemistry, statistical physics, among other disciplines. In this paper, we characterize the ordering of permanents of adjacency matrices of all graphs obtained from regular complete bipartite graph K p , p by deleting six edges. As an application, we show that all graphs with a perfect matching obtained from K p , p with six edges deleted are determined by their permanental polynomials.
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.
