The minimum size of a $k$-connected locally nonforesty graph

Abstract

A local subgraph of a graph is the subgraph induced by the neighborhood of a vertex. Thus a graph of order $n$ has $n$ local subgraphs. A graph $G$ is called locally nonforesty if every local subgraph of $G$ contains a cycle. Clearly, a graph is locally nonforesty if and only if every vertex of the graph is the hub of a wheel. We determine the minimum size of a $k$-connected locally nonforesty graph of order $n.$

arXiv comment12 pages, 2 figures. arXiv admin note: substantial text overlap with arXiv:2410.23702