Abstract
It is shown that a graph whose vertices have one of four possible degrees is edgereconstructible if eitherδ ≥ 8 ord ≥ 2log 2 68, whereδ andd are the minimum and the average degree of a graph respectively.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 callSimilar Papers
Paper Title
Journal
Date
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
