Abstract
A multiple-interval representation of a simple graph G assigns each vertex a union of disjoint real intervals, such that vertices are adjacent if and only if their assigned sets intersect. The total interval number I(G) is the minimum of the total number of intervals used in any such representation of G. We obtain the maximum value of I(G) for n-vertex graphs (⌈( n 2+1) 4 ⌉) , n-vertex outerplanar graphs (⌊ 3n 2−1 ⌋) , and m-edge connected graphs (⌊ (5m+2) 4 ⌋).
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.
