Bicyclic graphs with the smallest and largest numbers of connected sets

Résumé

For a graph $G$ with vertex set $V$, let N($G$) denote the number of nonempty subsets of $V$ that induce a connected graph in $G$. In this paper, we focus on determining N($G$) for $G$ in the family $\mathbb{B}_n$ of $n$-vertex bicyclic graphs. We find in $\mathbb{B}_n$ the structures of those graphs that possess the smallest, the largest, as well as the second-largest values of N($G$). Moreover, we compute the extreme values of N($G$) over $\mathbb{B}_n$.

Citer ce document

Accès au document

Texte intégral en lecture en ligne, réservé aux abonnés SPHAERO et aux membres de l'institution. Se connecter

Voir l'article sur le site de la revue

Auteur(s)

Statistiques

Consultations : 1

Téléchargements : 0