Per-Spectral Characterizations Of Some Bipartite Graphs

• Autorzy: Tingzeng Wu , Heping Zhang
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

permanent; permanental polynomial; per-spectrum; cospectral.

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 4
• Strony: 935-951

Daty

wydano

2017-11-27

otrzymano

2015-12-01

poprawiono

2016-07-25

zaakceptowano

2016-07-25

online

2017-09-02

Twórcy

autor

Tingzeng Wu

• 810007, P.R.

autor

Heping Zhang

• 730000, P.R.

Identyfikatory

DOI

10.7151/dmgt.1981