On the Szeged and Wiener complexities in graphs (Q6130108)
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 Szeged and Wiener complexities in graphs |
scientific article; zbMATH DE number 7833994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Szeged and Wiener complexities in graphs |
scientific article; zbMATH DE number 7833994 |
Statements
On the Szeged and Wiener complexities in graphs (English)
0 references
18 April 2024
0 references
Szeged complexity
0 references
Wiener complexity
0 references
\(\Theta\)-graph
0 references
bicyclic graphs
0 references
0.8753722906112671
0 references
0.7883437871932983
0 references
0.785893440246582
0 references
