View in EDS PDF Full Text

Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs.

Saved in:
Bibliographic Details
Title: Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs.
Authors: Dossou-Olory, Audace A. V.1
Source: Journal of Combinatorial Mathematics & Combinatorial Computing. Mar2026, Vol. 128, p119-142. 24p.
Database: Mathematics Source
Description
ISSN:08353026
DOI:10.61091/jcmcc128-07