Please use this identifier to cite or link to this item: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5564
Title: FURTHER RESULTS ON THE NEIGHBORHOOD NUMBER OF A GRAPH
Authors: KULLI, VR
SIGARKANTI, SC
Issue Date: 1992
Publisher: INDIAN NAT SCI ACAD
Citation: INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS , Vol. 23 , 8 , p. 575 - 577
Abstract: A 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.
URI: http://gukir.inflibnet.ac.in:8080/jspui/handle/123456789/5564
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.