Abstract
Let G be a nontrivial, undirected, simple graph. Let S be a subset of V (G). S is a restrained cost effective set of G if for each vertex v in S, degS(v) \(\leq\) degV (G)rS(v) and the subgraph induced by the vertex set, V (G) r S has no isolated vertex. The maximum cardinality of a restrained cost effective set is the restrained cost effective number, CEr(G). In this paper, the restrained cost effective sets of paths, cycles, complete graphs, complete product of graphs and graphs resulting from line graph of graphs with maximum degree of 2 were characterized. As a direct consequence, the bounds or exact values for the restrained cost effective number were determined as well.
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.
