Cospectral pairs of regular graphs with different connectivity

Research output: Working paperOther research output

Abstract

For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
Original languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Publication statusPublished - 11 Apr 2019

Publication series

NamearXiv
Volume1904.05936

Fingerprint

Dive into the research topics of 'Cospectral pairs of regular graphs with different connectivity'. Together they form a unique fingerprint.

Cite this