The number of connected sets in Apollonian networks

Zuwen Luo and Kexiang Xu

Applied Mathematics and Computation, 2024, vol. 479, issue C

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.

Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324003448
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:479:y:2024:i:c:s0096300324003448

DOI: 10.1016/j.amc.2024.128883

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().