Article
Full entry |
PDF
(0.5 MB)
Feedback
PDF
(0.5 MB)
Feedback
Keywords:
distance graph; graph distance; poset distance; isomorphism of partially ordered sets; distance
distance graph; graph distance; poset distance; isomorphism of partially ordered sets; distance
Summary:
A distance between finite partially ordered sets is studied. It is a certain measure of the difference of their structure.
References:
[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
[2] Chartrand G., Saba F., Zou H.-B.: Edge rotations and distance between graphs. Časop. pěst. mat. 110 (1985), 87-91. MR 0791281 | Zbl 0567.05044
[3] Johnson M.: A ordering of some metrics defined on the space of graphs. Czechoslovak Math. J. 37 (1987), 75-85. MR 0875130
[4] Zelinka B.: On a certain distance between isomorphism classes of graphs. Časop. pěst. mat. 100 (1975), 371-373. MR 0416995 | Zbl 0312.05121
[5] Zelinka B.: A distance between isomorphism classes of trees. Czechoslovak Math. J. 33 (1983), 126-130. MR 0687425 | Zbl 0523.05028
Search
Partner of
