On the planarity of line Mycielskian graph of a graph
Abstract
The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e. The vertex e is called the root of Lμ(G). This research paper deals with the characterization of planarity of line Mycielskian Graph Lμ(G) of a graph. Further, we also obtain the characterization on outerplanar, maximal planar, maximal outerplanar, minimally nonouterplanar and 1-planar of Lμ(G).
Keywords : Planar graph, Outerplanar, Maximal planar, Maximal outerplanar, Minimally nonouterplanar and 1-planar.
2010 AMS subject classifications : 05C07, 05C10, 05C38, 05C60, 05C76.
Keywords
Full Text:
PDFReferences
J. Czap and D. Hudak, 1-planarity of complete multiparatite graphs, Discrete Applied Mathematics, 160, (2012), 505-512.
M. B. Dillencourt, An upper bound on the shortness exponent of l-tough, maximal planar graphs, Discrete Mathematics, 90, (1991), 93-97.
F. Harary, Graph Theory, Addison-Wesley, Mass, Reading, (1969).
K. Kuratowski, Sur le probleme des courbes gauches en toplogie, Fund.Math,15, (1930), 271-283.
K. G. Mirajkar and Veena Mathad, THE LINE MYCIELSKIAN GRAPH OF A GRAPH, International Journal of Research and Analytical Reviews(IJRAR), 6(1), (2019), 277-280.
K. G. Mirajkar, Veena Mathad and Pooja B, Miscellaneous Properties of Line Mycielskian Graph of a Graph, International Jopurnal of Applied Engineering Research, 14(29), (2019), 4552-4556.
G. Ringel, Ein Sechsfarbenproblem auf der Kugel, Abhandlungen aus dem Mathematischen Seminar der Universit¨at Hamburg, 29, (1965), 107–117.
DOI: http://dx.doi.org/10.23755/rm.v38i0.506
Refbacks
- There are currently no refbacks.
Copyright (c) 2020 Keerthi G. Mirajkar, Anuradha V Deshpande
This work is licensed under a Creative Commons Attribution 4.0 International License.
Ratio Mathematica - Journal of Mathematics, Statistics, and Applications. ISSN 1592-7415; e-ISSN 2282-8214.