Abstract
It was shown that whether a graph G is determined by its generalized characteristic polynomial is equivalent to the same problem for a well defined bi-regular graph Gˆ. Also a unified approach is proposed to show that some new families of bi-regular graphs are characterized by their generalized characteristic polynomials.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
