Extremal problems for connected set enumeration

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 orde...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2023-12, Vol.340, p.41-52
Main Authors: Luo, Zuwen, Xu, Kexiang
Format: Article
Language:English
Subjects:
Connected set
Extremal graph
Graph parameter
Maximal k-degenerate graph
Maximal outerplanar graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2023.06.047