On the sum of all distances in composite graphs (Q1343276): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)e0092-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1995228121 / rank | |||
Normal rank | |||
Latest revision as of 08:26, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the sum of all distances in composite graphs |
scientific article |
Statements
On the sum of all distances in composite graphs (English)
0 references
1 February 1995
0 references
The sum of all distances is determined for the results of the following binary operations on graphs: (a) the product \(G_ 1\times G_ 2\), (b) the join \(G_ 1+ G_ 2\), (c) the composition \(G_ 1[G_ 2]\), (d) the corona \(G_ 1\circ G_ 2\) (all these are defined in F. Harary's book of 1969), and (e) the cluster \(G_ 1\{G_ 2\}\) which is obtained by taking one copy of \(G_ 1\) and \(| V(G_ 1)|\) copies of a rooted graph \(G_ 2\) and by identifying the root of the \(i\)th copy of \(G_ 2\) with the \(i\)th vertex of \(G_ 1\) for each \(i\).
0 references
distances
0 references
operations on graphs
0 references
product
0 references
join
0 references
composition
0 references
corona
0 references
cluster
0 references
