Cartesian Products of Graphs and Metric Spaces
Copyright policy )Cartesian Products of Graphs and Metric Spaces
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.
cartesian decomposition, finite metric space, factor, Computational Theory and Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Metric spaces, metrizability, connected graph, Geometry and Topology, Product spaces in general topology, Theoretical Computer Science
cartesian decomposition, finite metric space, factor, Computational Theory and Mathematics, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Metric spaces, metrizability, connected graph, Geometry and Topology, Product spaces in general topology, Theoretical Computer Science
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).10 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!