Abstract

A set of vertices in a graph is connected if it induces a connected subgraph. In this paper we consider the number N(G) of connected sets in a graph G. The problem of determining the value of N(G) is #P-complete in general. We present several sharp upper and lower bounds on N(G) in terms of the order of G and some parameters of G, including chromatic number, stability number, matching number and connectivity and also characterize the extremal graphs at which the bounds are attained. Moreover, we obtain sharp upper bounds on N(G) for restricted classes of graphs such as maximal k-degenerate graphs and maximal outerplanar graphs, with 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 call

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.