THE CONSTRUCTION OF COSPECTRAL COMPOSITE GRAPHS
Authors:
- 1 May 1979
- journal article
- Published by Wiley in Annals of the New York Academy of Sciences
- Vol. 319 (1) , 490-496
Abstract
Summary: An operation loosely described as a type of composition of graphs is studied. Under rather flexible conditions, the resulting composite graphs must be cospectral. This operation is sufficiently powerful to generate eighty‐one cospectral pairs with at most nine vertices. These pairs include the unique smallest cospectral pair, the smallest cospectral connected pair, and one pair of trees with nine vertices. It is felt that this operation provides a unified explanation of cospectrality in several cases that were previously viewed as coincidental.Keywords
This publication has 7 references indexed in Scilit:
- Some computational results on the spectra of graphs1976
- Products of graphs and their spectra1976
- Isospectral graphs and moleculesTetrahedron, 1975
- Cospectral Graphs and DigraphsBulletin of the London Mathematical Society, 1971
- GRAPH THEORY1969
- Combinatorial Chance.Economica, 1962
- Spektren endlicher grafenAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1957