Abstract
In the present paper we are interested in the saturation number of closed benzenoid chains and certain families of nanotubes. The saturation number of a graph is the cardinality of a smallest maximal matching in the graph. The problem of determining the saturation number is related to the edge dominating sets and efficient edge dominating sets in a graph. We establish the saturation number of some closed benzenoid chains and C 4 C 6 -tubes. Further, upper and lower bounds for the saturation number of armchair, zig-zag, T U C 4 C 8 ( S ) and T U C 4 C 8 ( R ) nanotubes are calculated.
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.
