The blict graph and blitact graph of a graph
V. R. Kulli, M. S. Biradar
Abstract
V. R. Kulli, M. S. Biradar
Abstract
In this paper, we introduce the concepts of the blict graph and blitact graph of a graph. We obtain some properties of these graphs. We present characterizations of graphs whose blict graphs and blitact graphs are planar, outerplanar, maximal outerplanar and minimally nonouterplanar. We also characterize those graphs whose blict graphs and blitact graphs are isomorphic.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we introduce the concepts of the blict graph and blitact graph of a graph. We obtain some properties of these graphs. We present characterizations of graphs whose blict graphs and blitact graphs are planar, outerplanar, maximal outerplanar and minimally nonouterplanar. We also characterize those graphs whose blict graphs and blitact graphs are isomorphic.
Key concepts: Outerplanar graph, Pathwidth, Combinatorics, 1-planar graph, Cograph, Chordal graph, Block graph, Mathematics