The communicability distance in graphs (Q414715): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Q4692391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing Effective Resistance of a Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5708561 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A class of graph-geodetic distances generalizing the shortest-path and the resistance distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The walk distances in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Encyclopedia of Distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3954439 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Properties of Euclidean and non-Euclidean distance matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3661894 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Spektren endlicher Grafen / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:12, 5 July 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
0 references
0 references