Sharp lower bound for the total number of matchings of tricyclic graphs (Q1960286): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreie7fqv63fhf3r5zojtst7xme65v7uorgquw5dkvtm446wfoajndui / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:22, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sharp lower bound for the total number of matchings of tricyclic graphs |
scientific article |
Statements
Sharp lower bound for the total number of matchings of tricyclic graphs (English)
0 references
13 October 2010
0 references
Summary: Let \(\mathcal T_n\) be the class of tricyclic graphs on \(n\) vertices. In this paper, a sharp lower bound for the total number of matchings of graphs in \(\mathcal T_n\) is determined.
0 references
tricyclic graphs
0 references
total number of matchings
0 references
