- Tytuł:
- Per-Spectral Characterizations Of Some Bipartite Graphs
- Autorzy:
-
Wu, Tingzeng
Zhang, Heping - Powiązania:
- https://bibliotekanauki.pl/articles/31341599.pdf
- Data publikacji:
- 2017-11-27
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
permanent
permanental polynomial
per-spectrum
cospectral - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 4; 935-951
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł