Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness (Q2007806)
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: Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge k-partiteness |
scientific article; zbMATH DE number 7135215
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness |
scientific article; zbMATH DE number 7135215 |
Statements
Theoretical and computational methods to minimize Kirchhoff index of graphs with a given edge \(k\)-partiteness (English)
0 references
22 November 2019
0 references
Kirchhoff index
0 references
edge \(k\)-partiteness
0 references
resistance distance
0 references
exhaustive search
0 references
0 references
0 references
0 references
