Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs.
Saved in:
| 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 |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 191370699 AccessLevel: 2 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Dossou-Olory%2C+Audace+A%2E+V%2E%22">Dossou-Olory, Audace A. V.</searchLink><relatesTo>1</relatesTo> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Combinatorial+Mathematics+%26+Combinatorial+Computing%22">Journal of Combinatorial Mathematics & Combinatorial Computing</searchLink>. Mar2026, Vol. 128, p119-142. 24p. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=191370699 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.61091/jcmcc128-07 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 24 StartPage: 119 Titles: – TitleFull: Cut vertex and unicyclic graphs with the maximum number of connected induced subgraphs. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Dossou-Olory, Audace A. V. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 08353026 Numbering: – Type: volume Value: 128 Titles: – TitleFull: Journal of Combinatorial Mathematics & Combinatorial Computing Type: main |
| ResultId | 1 |