Cartesian products of graphs and metric spaces (Q1587905): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/eujc.2000.0401 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2089225250 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3944558 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4039397 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph multiplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Prefibers and the cartesian product of metric spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4936660 / rank | |||
Normal rank |
Latest revision as of 10:47, 3 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cartesian products of graphs and metric spaces |
scientific article |
Statements
Cartesian products of graphs and metric spaces (English)
0 references
30 December 2001
0 references
The authors give a short proof of the known fact that decomposition of a connected graph into a cartesian product of indecomposable factors is unique up to isomorphism. They then present a generalization of the results which shows uniqueness of decomposition for a wide class of product operations on general finite metric spaces.
0 references
cartesian decomposition
0 references
finite metric space
0 references
connected graph
0 references
factor
0 references