Abstract
For connected graph G, the neighbourhood polynomial is defined as N(G, x) = ∑ UϵN(G )x|U| ([4]) where (G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbor. Recently, Husin and Hasni (2018) [8] compute the neighbourhood polynomial for some families of dendrimers. In this paper, we examine neighbourhood polynomial of some interested standard graph networks like silicate, hexagonal and oxide networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
