Per-spectral characterizations of some edge-deleted subgraphs of a complete graph

References

• Lovász L, Plummer MD. Matching theory. Providence (RI): American Mathematical Society; 2009.
   Google Scholar
• Valiant LG. The complexity of computing the permanent. Theor. Comput. Sci. 1979;8:189–201.
   Google Scholar
• Turner J. Generalized matrix functions and the graph isomorphism problem. SIAM J. Appl. Math. 1968;16:520–526.
   Web of Science ®Google Scholar
• Merris R, Rebman KR, Watkins W. Permanental polynomials of graphs. Linear Algebra Appl. 1981;38:273–288.
   Web of Science ®Google Scholar
• Kasum D, Trinajstić N, Gutman I. Chemical graph theory. III. On permanental polynomial. Croat. Chem. Acta. 1981;54:321–328.
   Web of Science ®Google Scholar
• Borowiecki M, Jóźwiak T. A note on characteristic and permanental polynomials of multigraphs. In: Borowiecki M, Kennedy JW, Sysło MM, editors. Graph theory. Berlin: Springer-Verlag; 1983. p. 75–78.
   Google Scholar
• Yan W, Zhang F. On the permanental polynomial of some graphs. J. Math. Chem. 2004;35:175–188.
   Web of Science ®Google Scholar
• Zhang H, Li W. Computing the permanental polynomials of bipartite graphs by Pfaffian orientation. Discrete Appl. Math. 2012;160:2069–2074.
   Web of Science ®Google Scholar
• Gutman I, Cash GG. Relations between the permanental and characteristic polynomials of fullerenes and benzenoid hydrocarbons. MATCH Commun. Math. Comput. Chem. 2002;45:55–70.
   Google Scholar
• Chen R. A note on the relations between the permanental and characteristic polynomials of coronoid hydrocarbons. MATCH Commun. Math. Comput. Chem. 2004;51:137–148.
   Google Scholar
• Cash GG. The permanental polynomial. J. Chem. Inf. Comput. Sci. 2000;40:1203–1206.
   PubMedGoogle Scholar
• Cash GG. Permanental polynomials of smaller fullerenes. J. Chem. Inf. Comput. Sci. 2000;40:1207–1209.
   PubMedGoogle Scholar
• Belardo F, Li Marzi EM, Simić SK. Schwenk-like formulas for weighted digraphs. In: Simos TE, Psihoyios G, Tsitouras C, editors. Numerical analysis and applied mathematics. Vol. 2. CP1168; Crete; 2009. p. 1251–1254.
   Google Scholar
• Belardo F, De Filippis V, Simić SK. Computing the permanental polynomial of a matrix from a combinatorial viewpoint. MATCH Commun. Math. Comput. Chem. 2011;66:381–396.
   Web of Science ®Google Scholar
• Huo Y, Liang H, Bai F. An efficient algorithm for computing permanental polynomials of graphs. Comput. Phys. Comm. 2006;175:196–203.
   Web of Science ®Google Scholar
• Li W, Zhang H. The permanental polynomials of certain graphs. MATCH Commun. Math. Comput. Chem. 2012;68:871–888.
   Web of Science ®Google Scholar
• Liang H, Tong H, Bai F. Computing the permanental polynomial of C60 in parallel. MATCH Commun. Math. Comput. Chem. 2008;60:349–358.
   Web of Science ®Google Scholar
• Tong H, Liang H, Bai F. Permanental polynomials of the larger fullerenes. MATCH Commun. Math. Comput. Chem. 2006;56:141–152.
   Web of Science ®Google Scholar
• Zhang H, Liu S, Li W. A note on the permanental roots of bipartite graphs. Discuss. Math. Graph Theory. Forthcoming. doi: 10.7151/dmgt.1704.
   Google Scholar
• van Dam ER, Haemers WH. Which graphs are determined by their spectrum? Linear Algebra Appl. 2003;373:241–272.
   Web of Science ®Google Scholar
• Doob M, Haemers WH. The complement of the path is determined by its spectrum. Linear Algebra Appl. 2002;356:57–65.
   Web of Science ®Google Scholar
• Wang W, Xu C. On the spectral characterization of T-shape trees. Linear Algebra Appl. 2006;414:492–501.
   Web of Science ®Google Scholar
• Boulet R, Jouve B. The lollipop is determined by its spectrum. Electron. J. Combin. 2008;15:#R74.
   Google Scholar
• Haemers WH, Liu XG, Zhang YP. Spectral characterizations of lollipop graphs. Linear Algebra Appl. 2008;428:2415–2423.
   Web of Science ®Google Scholar
• Ramezani F, Broojerdian N, Tayfeh-Rezaie B. A note on the spectral characterization of θ-graphs. Linear Algebra Appl. 2009;431:626–632.
   Web of Science ®Google Scholar
• Ghareghai N, Omidi GR, Tayfeh-Rezaie B. Spectral characterization of graphs with index at most 2 + 5. Linear Algebra Appl. 2007;420:483–489.
   Web of Science ®Google Scholar
• Zhang X, Zhang H. Some graphs determined by their spectra. Linear Algebra Appl. 2009;431:1443–1454.
   Web of Science ®Google Scholar
• Harary F, King C, Mowshowitz A, Read RC. Cospectal graphs and digraphs. Bull. Lond. Math. Soc. 1971;3:321–328.
   Google Scholar
• Liu S, Zhang H. On the characterizing properties of the permanental polynomials of graphs. Linear Algebra Appl. 2013;438:157–172.
   Web of Science ®Google Scholar
• Liu S, Zhang H. Characterizing properties of permanental polynomials of lollipop graphs. Linear Multilinear Algebra. 2013. http://dx.doi.org/10.1080/03081087.2013.779271.
   Web of Science ®Google Scholar
• Cámara M, Haemers WH. Spectral characterizations of almost complete graphs. Discrete Appl. Math. Forthcoming 2013. http://dx.doi.org/10.1016/j.dam.2013.08.002
   PubMedGoogle Scholar
• Harary F, Palmer EM. Graphical enumeration. New York (NY): Academinc Press; 1973.
   Google Scholar