Answers are grounded in this paper and cite their sources.
Characterisation of graphs with minimum connected subgraphs in relation to vertex and cut vertices properties, suggesting novel classifications.
The subgraph number of a vertex in a graph is defined as the number of connected subgraphs containing that vertex. The graph and its vertex which correspond to the minimum subgraph number among all graphs on n vertices and k cut vertices have been characterised. Further, using this characterisation, the graphs with the minimum number of connected subgraphs among all graphs on n vertices and k cut vertices, with girth at least k, have been obtained. This turns out to characterise the graphs with the minimum number of connected subgraphs among all graphs on n vertices and k cut vertices for 0 ≤ k ≤ 4.
No takes yet. Share an insight, caveat, or question.
Pandey et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: