# Getting edge cut from eigenvector of adjacency matrix

Given a $d$-regular undirected graph and an eigenvector of its adjacency matrix, how can I get an edge cut from it?

My idea was to do something similar as in the proof of the Cheeger inequality, but so far I was not successful.

Thanks

-