Semi-Image Neighborhood Block Graphs with Crossing Numbers
Keywords:Semi-Image, Neighborhood block, Crossing numbers.
The advent of graph theory has played a prominent role in wide variety of engineering applications. Minimization of crossing numbers in graphs optimizes its use in many applications. In this paper, we establish the necessary and sufficient condition for Semi-Image neighborhood block graph to have crossing number 3. We also prove that the Semi-Image neighborhood block graph NBI(G) of a graph never has crossing numbers k, where 1 ? k ? 6.
Keywords: Semi-Image; Neighborhood block; Crossing numbers.
© 2013 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.
doi: http://dx.doi.org/10.3329/jsr.v5i2.11019 J. Sci. Res. 5 (2), 295-299 (2013)
How to Cite
© Journal of Scientific Research
Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.