The communicability distance in graphs (Q414715)
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: The communicability distance in graphs |
scientific article; zbMATH DE number 6033323
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The communicability distance in graphs |
scientific article; zbMATH DE number 6033323 |
Statements
The communicability distance in graphs (English)
0 references
11 May 2012
0 references
This paper discusses communicability distance on a Euclidean distance and gives explanations for paths, cycles, stars and complete graphs on \(n\)-nodes. A new graph invariant, the sum of all communicability distances in graphs, is introduced and compared with standard invariant Wiener and Kirchhoff indices of graphs
0 references
Euclidean distance
0 references
communicability
0 references
0 references
0 references
0.7882542610168457
0 references
0.7489761710166931
0 references
0.7484095692634583
0 references
0.7428579330444336
0 references
