Abstract
A vertex whose removal in a graph G increases the number of components of G is called a cut vertex. For all n, c, we determine the maximum number of connected induced subgraphs in a connected graph with order n and c cut vertices, and also characterise those graphs attaining the bound. Moreover, we show that the cycle has the smallest number of connected induced subgraphs among all cut vertex-free connected graphs. The general case $$c>0$$ remains an open task. We also characterise the extremal graph structures given both order and number of pendant vertices, and establish the corresponding formulas for the number of connected induced subgraphs. The ‘minimal’ graph in this case is a tree, thus coincides with the structure that was given by Li and Wang (Electron J Comb 19(4):P48, 2012).
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.
