The communicability distance in graphs (Q414715): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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 | |||
| Property / review text: 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 / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: G. Narasimha-Shenoi Prasanth / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C12 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15A18 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 15A16 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6033323 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Euclidean distance | |||
| Property / zbMATH Keywords: Euclidean distance / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
communicability | |||
| Property / zbMATH Keywords: communicability / rank | |||
Normal rank | |||
Revision as of 20:21, 29 June 2023
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
