TWO CLASSES OF GRAPHS CHARACTERIZED BY THEIR SPECTRA

Sun Liang. TWO CLASSES OF GRAPHS CHARACTERIZED BY THEIR SPECTRAJ. Transactions of Beijing institute of Technology, 1987, (2).

Citation:

Sun Liang. TWO CLASSES OF GRAPHS CHARACTERIZED BY THEIR SPECTRAJ. Transactions of Beijing institute of Technology, 1987, (2).

Citation:

Sun Liang. TWO CLASSES OF GRAPHS CHARACTERIZED BY THEIR SPECTRAJ. Transactions of Beijing institute of Technology, 1987, (2).

Abstract

In this paper, it is proved that the following two classes of graphs can be characterized by their spectra. (1) the complete product of a complete graph and the disjoint union of two complete graphs; (2) the direct product of an odd cycle with at least 3 vertices and a complete graph with two vertices.

FullText(HTML)

Turn off MathJax

Article Contents

Export File