Per-spectral characterizations of some bipartite graphs | Zendy

Tingzeng Wu | Zendy; Heping Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Per-spectral characterizations of some bipartite graphs

Author(s) -

Tingzeng Wu,

Heping Zhang

Publication year - 2017

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1981

Subject(s) - mathematics , bipartite graph , combinatorics , cograph , discrete mathematics , chordal graph , graph , 1 planar graph

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research