1. IR @ Gulbarga University
  2. Faculty Publications
  3. 1. Journal Articles
Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5564
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKULLI, VR
dc.contributor.authorSIGARKANTI, SC
dc.date.accessioned2020-06-12T15:08:15Z-
dc.date.available2020-06-12T15:08:15Z-
dc.date.issued1992
dc.identifier.citationINDIAN JOURNAL OF PURE & APPLIED MATHEMATICS , Vol. 23 , 8 , p. 575 - 577en_US
dc.identifier.urihttp://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5564-
dc.description.abstractA set of vertices A of a graph G is a neighbourhood set if [GRAPHICS] where < N [nu] >. is the subgraph induced by nu and all vertices adjacent to nu. The neighbourhood number n(G) of a graph G equals the minimum number of vertices in a neighbourhood sa of G. In this paper, we establish Nordhaus-Gaddum type results for the neighbourhood number n(G) of a graph G.en_US
dc.publisherINDIAN NAT SCI ACAD
dc.titleFURTHER RESULTS ON THE NEIGHBORHOOD NUMBER OF A GRAPHen_US
dc.typeArticle
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.