International Journal of Mathematics Trends and Technology
Volume 49 | Number 3 | Year 2017 | Article Id. IJMTT-V49P530 | DOI : https://doi.org/10.14445/22315373/IJMTT-V49P530
The Cartesian product G=G1xG2 of any two graphs G1 and G2 has been studied widely in graph theory ever since the operation has been introduced. G=G1xG2 gives insight to the structural property of G, if G1 and G2 are known. The neighbourhood polynomial plays a vital role in describing the neighbourhood characteristics of the vertices of a graph. In this study neighbourhood polynomial of the Cartesian product of certain classes of graphs are calculated and tried to characterize the nature of neighbourhood polynomial.
[1] Jason I. Brown, Richard J. Nowakowski, “The neighbourhood polynomial of a graph”, Australian journal of Combinatorics, Volume 42(2008), Pages 55-68.
[2] G.Suresh Singh, “Graph Theory”, PHI Learning Private Limited, New Delhi, 2010.
G. Suresh Singh, Sreedevi S.L., "Cartesian product and Neighbourhood Polynomial of a Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 49, no. 3, pp. 205-209, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V49P530
PDF 
Abstract 
Keywords 
References 
Citation