Abstract
Let G be a simple graph with vertex set {v1,v2,...,vn} .T he common neighborhood graph (congraph) of G, denoted by con(G), is the graph with vertex set {v1,v2,...,vn}, in which two vertices are adjacent if and only they have at least one common neighbor in the graph G.T he basic properties of con(G) and of its energy are established.
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 callMore From: Iranian Journal of Mathematical Sciences and Informatics
Disclaimer: 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.
