The communicability distance in graphs (Q414715): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.laa.2012.01.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1979832945 / rank | |||
Normal rank | |||
Revision as of 02:24, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The communicability distance in graphs |
scientific article |
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
