Keywords:-
Article Content:-
Abstract
Graph polynomial is one of the algebraic representations for graph. In this paper, we introduce a new type of graph polynomial called connected neighbourhood polynomial and we defined the connected neighbourhood roots of a graph. The connected neighbourhood polynomial of some standard graphs is obtained and some properties of this polynomial are established.
References:-
References
Saeid Alikhani and Yee-hock Peng, Introduction to domination polynomial of graph,arXiv: 0905.225 1 V 1 (2009).
Anwar Alwardi and P.M. Shivaswamy, On the neighbourhood polynomial of graphs,
Bulletin of the international mathematical virtual institute, 6 (2016), 13-24
J. Bondy and U. Murthy, Graph Theory with applications, North Holland,
New York, (1976).
B. Chaluvaraju, Some parameters on neighborhood number of a graph, Electronic Notes
in Discrete Mathematics 33 (2009) 139–146
Harary, F., Graph Theory, Addison Wesley, Massachusetts, 1969.
E. Sampathkumar and P. S. Neeralagi, The neighborhood number of a graph, Indian J.
Pure and Appl. Math.16 (2) (1985) 126 - 132.
H. B. Walikar, B. D. Acharya and E. Sampathkumar, Recent developments in the theory
of domination in graphs, Mehta Research Institute, Alahabad, MRI Lecture Notes in
Math. 1(1979)