Per-Spectral Characterizations Of Some Bipartite Graphs

Abstract A graph is said to be characterized by its permanental spectrum if there is no other non-isomorphic graph with the same permanental spectrum. In this paper, we investigate when a complete bipartite graph Kp,p with some edges deleted is determined by its permanental spectrum. We first prove that a graph obtained from Kp,p by deleting all edges of a star K1,l, provided l < p, is determined by its permanental spectrum. Furthermore, we show that all graphs with a perfect matching obtained from Kp,p by removing five or fewer edges are determined by their permanental spectra.

[1]  Heping Zhang,et al.  Per-spectral and adjacency spectral characterizations of a complete graph removing six edges , 2016, Discret. Appl. Math..

[2]  Fengshan Bai,et al.  Computing the Permanental Polynomial of the High Level Fullerene C 70 with High Precision , 2022 .

[3]  Russell Merris,et al.  Permanental polynomials of graphs , 1981 .

[4]  H. Lai,et al.  Per-spectral characterizations of some edge-deleted subgraphs of a complete graph , 2015 .

[5]  Gordon G. Cash,et al.  Permanental Polynomials of the Smaller Fullerenes , 2000, J. Chem. Inf. Comput. Sci..

[6]  I. Gutmana,et al.  On the Permanental Polynomial , 2018 .

[7]  Wei Li,et al.  Computing the permanental polynomials of bipartite graphs by Pfaffian orientation , 2010, Discret. Appl. Math..

[8]  Heping Zhang,et al.  Some analytical properties of the permanental polynomial of a graph , 2015, Ars Comb..

[9]  Frank Harary,et al.  Cospectral Graphs and Digraphs , 1971 .

[10]  Wei Li,et al.  A Note on the Permanental Roots of Bipartite Graphs , 2014, Discuss. Math. Graph Theory.

[11]  Heping Zhang,et al.  Characterizing properties of permanental polynomials of lollipop graphs , 2014 .

[12]  Francesco Belardo,et al.  Computing the Permanental Polynomial of a Matrix from a Combinatorial Viewpoint , 2011 .

[13]  Heping Zhang,et al.  Per-spectral characterizations of graphs with extremal per-nullity , 2015 .

[14]  Willem H. Haemers,et al.  Developments on Spectral Characterizations of Graphs , 2007, Discret. Math..

[15]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[16]  W. Haemers,et al.  Which graphs are determined by their spectrum , 2003 .

[17]  Mieczysław Borowiecki,et al.  A note on characteristic and permanental polynomials of multigraphs , 1983 .

[18]  E. J. Farrell,et al.  On matching coefficients , 1991, Discret. Math..

[19]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[20]  Heping Zhang,et al.  On the characterizing properties of the permanental polynomials of graphs , 2013 .