The Spectrum Of Infinite Complite Multipartite Graphs
Miroslav M. Petrović (1982)
Publications de l'Institut Mathématique
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Some remarks on integral graphs with maximum degree four.”
The Spectrum Of Infinite Complite Multipartite Graphs
Graphs with the Reduced Spectrum in the Unit Interval
Aleksandar Torgašev (1984)
Publications de l'Institut Mathématique
Similarity:
On Spectrum and Per-spectrum of Graphs
Mieczyslaw Borowiecki (1985)
Publications de l'Institut Mathématique
Similarity:
Cospectral graphs on 12 vertices.
Brouwer, A.E., Spence, E. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Spectra Of Graphs Formed By Some Unary Operations
Dragoš Cvetković (1975)
Publications de l'Institut Mathématique
Similarity:
Some Classes of Integral Graphs Which Belong to the Class Alpha Ka u Beta Kb,b
Mirko Lepović (2003)
Publications de l'Institut Mathématique
Similarity:
Per-Spectral Characterizations Of Some Bipartite Graphs
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...