Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/12186Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Sowmya, Kamath S. | - |
| dc.contributor.author | Kolake, P. | - |
| dc.date.accessioned | 2020-03-31T08:38:46Z | - |
| dc.date.available | 2020-03-31T08:38:46Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.citation | Indian Journal of Pure and Applied Mathematics, 2016, Vol.47, 1, pp.97-110 | en_US |
| dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/12186 | - |
| dc.description.abstract | Let G be a graph and v be any vertex of G. Then the neighborhood contracted graphGv of G, with respect to the vertex v, is the graph with vertex set V ? N(v), where two vertices u,w ? V ? N(v) are adjacent in Gv if either w = v and u is adjacent to any vertex of N(v) in G or u,w ? N[v] and u,w are adjacent in G. The properties of the neighborhood contracted graphs are discussed in this paper. The neighborhood contraction in some special class of graphs, the domination in a graph and the neighborhood contracted graphs are discussed in the paper. 2015, The Indian National Science Academy. | en_US |
| dc.title | Neighborhood contraction in graphs | en_US |
| dc.type | Article | en_US |
| 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.