Abstract
Let G be a simple graph with vertex set {v1,v2,…,vn}. The common neighborhood graph (congraph) of G, denoted by con(G), is a graph with vertex set {v1,v2,…,vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper we compute the common neighborhood of some composite graphs. In continue we investigate the relation between hamiltonicity of graph G and con(G). Also we obtain a lower bound for the clique number of con(G) in terms of clique number of graph G. Finally we state that the total chromatic number of G is bounded by chromatic number of con(T(G)).
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.
