Per-Spectral Characterizations Of Some Bipartite Graphs

Tingzeng Wu, and Heping Zhang. "Per-Spectral Characterizations Of Some Bipartite Graphs." Discussiones Mathematicae Graph Theory 37.4 (2017): 935-951. <http://eudml.org/doc/288307>.

@article{TingzengWu2017,
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.},
author = {Tingzeng Wu, Heping Zhang},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {permanent; permanental polynomial; per-spectrum; cospectral.},
language = {eng},
number = {4},
pages = {935-951},
title = {Per-Spectral Characterizations Of Some Bipartite Graphs},
url = {http://eudml.org/doc/288307},
volume = {37},
year = {2017},
}

TY - JOUR
AU - Tingzeng Wu
AU - Heping Zhang
TI - Per-Spectral Characterizations Of Some Bipartite Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 4
SP - 935
EP - 951
AB - 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.
LA - eng
KW - permanent; permanental polynomial; per-spectrum; cospectral.
UR - http://eudml.org/doc/288307
ER -