Abstract
For a graph G with n vertices, let and A(G) denote the matching number and adjacency matrix of G, respectively. The permanental polynomial of G is defined as . The permanental nullity of G, denoted by , is the multiplicity of the zero root of . In this paper, we use the Gallai–Edmonds structure theorem to derive a concise formula which reveals the relationship between the permanental nullity and the matching number of a graph. Furthermore, we prove a necessary and sufficient condition for a graph G to have . As applications, we show that every unicyclic graph G on n vertices satisfies , that the permanental nullity of the line graph of a graph is either zero or one and that the permanental nullity of a factor critical graph is always zero.
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.
