Please use this identifier to cite or link to this item:
http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5825
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kulli V.R | |
dc.contributor.author | Biradar M.S. | |
dc.date.accessioned | 2020-06-12T15:08:59Z | - |
dc.date.available | 2020-06-12T15:08:59Z | - |
dc.date.issued | 2001 | |
dc.identifier.citation | Journal of Discrete Mathematical Sciences and Cryptography , Vol. 4 , 43864 , p. 151 - 162 | en_US |
dc.identifier.uri | 10.1080/09720529.2001.10697927 | |
dc.identifier.uri | http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5825 | - |
dc.description.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. © 2001 Taylor & Francis Group, LLC. | en_US |
dc.title | The blict graph and blitact graph of a graph | en_US |
dc.type | Article | |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.