On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy (Q5744571)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy |
scientific article; zbMATH DE number 6542501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy |
scientific article; zbMATH DE number 6542501 |
Statements
On the tricyclic graphs with three disjoint 6-cycles and maximum matching energy (English)
0 references
18 February 2016
0 references
tricyclic graph
0 references
matching energy
0 references
\(k\)-matching
0 references
matching polynomial
0 references
0.9153729677200316
0 references
0.8812169432640076
0 references
0.8771048188209534
0 references
0.8708040714263916
0 references
0.8542338013648987
0 references
