Abstract
On this research we study EPG graphs, in particular, we are interested on investigate the intersection between split and B2-EPGgraph classes. The results found in the literature regarding split graphs only concern about characterization in B1-EPG, that despite bringing some graphs that belong to this class, the bend number of split graphs it is still unknown. We study the split graphs whose degree of vertices on independent set is less than 2. In this work we manipulate bipartite graphs and we present representation for some bipartite graphs in B2-EPG. We build an algorithm that create a Split B2-EPG representation, also we present another algorithm that builds a representation on a grid Qw×2y+1 for any Split graph, and other results.
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 callMore From: Academic Journal on Computing, Engineering and Applied Mathematics
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.
