Abstract
Abstract A graph G on n vertices is a tight distance graph if there exists a set D ⊆ { 1 , 2 , … , n − 1 } such that V ( G ) = { 0 , 1 , … , n − 1 } and i j ∈ E ( G ) if and only if | i − j | ∈ D . A characterization of the degree sequences of tight distance graphs is given. This characterization yields a fast method for recognizing and realizing degree sequences of tight distance graphs.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
