Abstract
A vertex subset in a graph that induces a connected subgraph is referred to as a connected set. Counting the number of connected sets N(G) in a graph G is generally a #P-complete problem. In our recent work [Graphs Combin. (2024)], a linear recursive algorithm was designed to count N(G) in any Apollonian network. In this paper we extend our research by establishing a tight upper bound on N(G) in Apollonian networks with an order of n≥3, along with a characterization of the graphs that reach this upper bound. Our approach primarily utilizes linear programming techniques. Moreover, we propose a conjecture regarding the lower bound on N(G) in Apollonian networks with a given order.
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.
