Abstract
A dominating set S of a connected graph G = (V;E) is a neighborhood connected dominating set (ncd-set) if the induced subgraph hN(S)i of G is connected. The neighborhood connected domination number nc(G) is the minimum cardinality of a ncd-set. The minimum number of colours required to colour all the vertices such that no two adjacent vertices have same colour is the chromatic number _(G) of G. In this paper we find an upper bound for sum of the ncd-number and chromatic number and characterize the corresponding extremal graphs.
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: International Journal of Mathematics and Soft Computing
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.
