The Spectrum Of Infinite Complite Multipartite Graphs
Miroslav M. Petrović (1982)
Publications de l'Institut Mathématique
Similarity:
Miroslav M. Petrović (1982)
Publications de l'Institut Mathématique
Similarity:
Aleksandar Torgašev (1984)
Publications de l'Institut Mathématique
Similarity:
Mieczyslaw Borowiecki (1985)
Publications de l'Institut Mathématique
Similarity:
Brouwer, A.E., Spence, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dragoš Cvetković (1975)
Publications de l'Institut Mathématique
Similarity:
Mirko Lepović (2003)
Publications de l'Institut Mathématique
Similarity:
Tingzeng Wu, Heping Zhang (2017)
Discussiones Mathematicae Graph Theory
Similarity:
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...