The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision. (Q4598984)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6819560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum matching energy of tricyclic graphs with given girth and without \(K_4\)-subdivision. |
scientific article; zbMATH DE number 6819560 |
Statements
15 December 2017
0 references
matching energy
0 references
graph energy
0 references
tricyclic graph
0 references
girth
0 references
0.9098405838012696
0 references
0.8900629281997681
0 references
0.8771048188209534
0 references
0.8565767407417297
0 references
0.8548044562339783
0 references
