Previous |  Up |  Next

Article

Title: Distances between partially ordered sets (English)
Author: Zelinka, Bohdan
Language: English
Journal: Mathematica Bohemica
ISSN: 0862-7959 (print)
ISSN: 2464-7136 (online)
Volume: 118
Issue: 2
Year: 1993
Pages: 167-170
Summary lang: English
.
Category: math
.
Summary: A distance between finite partially ordered sets is studied. It is a certain measure of the difference of their structure. (English)
Keyword: distance graph
Keyword: graph distance
Keyword: poset distance
Keyword: isomorphism of partially ordered sets
Keyword: distance
MSC: 05C12
MSC: 05C60
MSC: 06A07
idZBL: Zbl 0787.06004
idMR: MR1223482
DOI: 10.21136/MB.1993.126044
.
Date available: 2009-09-24T20:58:27Z
Last updated: 2020-07-29
Stable URL: http://hdl.handle.net/10338.dmlcz/126044
.
Reference: [1] Baláž V., Koča J., Kvasnička V., Sekanina M.: A metric for graphs.Časop. pěst. mat. 111 (1986), 431-433. MR 0871718
Reference: [2] Chartrand G., Saba F., Zou H.-B.: Edge rotations and distance between graphs.Časop. pěst. mat. 110 (1985), 87-91. Zbl 0567.05044, MR 0791281
Reference: [3] Johnson M.: A ordering of some metrics defined on the space of graphs.Czechoslovak Math. J. 37 (1987), 75-85. MR 0875130
Reference: [4] Zelinka B.: On a certain distance between isomorphism classes of graphs.Časop. pěst. mat. 100 (1975), 371-373. Zbl 0312.05121, MR 0416995
Reference: [5] Zelinka B.: A distance between isomorphism classes of trees.Czechoslovak Math. J. 33 (1983), 126-130. Zbl 0523.05028, MR 0687425
.

Files

Files Size Format View
MathBohem_118-1993-2_6.pdf 525.0Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo