Abstract
In this paper, we introduce the concept of the total block edge cut vertex graph. We obtain some properties of these graphs. We present characterization of graphs whose block edge cut vertex graphs planar outer planar, minimally non outer planar and crossing number one.
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: International Journal of Applied Mathematical Research
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.
