Neighborhood Number In Graphs

Volume 5, Issue 4, pp 265 - 270 Publication Date: December 30, 2012

Authors

Z. Tahmasbzadehbaee - Department of Mathematics, University of Mysore, Manasagangotri, Mysore-570 006, India.
N. S. Soner - Department of Mathematics, University of Mysore, Manasagangotri, Mysore-570 006, India.
D. A. Mojdeh - Department of Mathematics, University of Tafresh, Tafresh, Iran.


Abstract

A set \(S\) of points in graph \(G\) is a neighborhood set if \(G=\cup_{\nu\in S}\langle N[\nu]\rangle\) where \(\langle N[\nu]\rangle\) is the subgraph of \(G\) induced by \(\nu\) and all points adjacent to \(\nu\). The neighborhood number, denoted \(n_0(G)\), of \(G\) is the minimum cardinality of a neighborhood set of \(G\). In this paper, we study the neighborhood number of certain graphs.


Keywords


References

[1] J. C. Bermond, F. Comellas and D. F. Hsu, Distributed loop computer networks: a survey, J. Paralled Distrib. Comput. 24 (1995), 2-10.
[2] F. Boesch and R. Tindell, Circulants and their connectivity, J. Graph Theory 8 (1984), 487-499.
[3] S. Ghobadi, N. D. Soner and D. A. Mojdeh, Vertex neighborhood critical graphs, International Journal of Mathematics and Analysis, 9(1-6)(2008), 89-95.
[4] E. Sampathkumar and P. S. Neeralagi, Independent, Perfect and Connected neighborhood number of a graph, Journal of Combinatorics, Information & System Sciences, 19(3-4)(1994), 139-145.
[5] E. Sampathkumar and P. S. Neeralagi, The neighborhood number of a graph, Indian J. Pure Appl. Math., 16(2)(1985), 126-132.
[6] D. B. West, Introduction to graph theory (Second Edition), Prentice Hall, USA, 2001.