Semi-Image Neighborhood Block Graphs with Crossing Numbers

Abstract

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 SemiImage neighborhood block graph to have crossing number 3. We also prove that the SemiImage neighborhood block graph NB I (G) of a graph never has crossing numbers k, where 1 ≤ k ≤ 6.

Forbidden Subgraphs for Planar Vertex Semi-Middle Graph

“…1. Many other graph valued functions in graph theory were studied, for example, in [4][5][6][7][8][9][10][11][12][13][14][15][16][18][19][20][21].…”