- reconstructible graph
- мат. перестраиваемый граф
Большой англо-русский и русско-английский словарь. 2001.
reconstructible graph
Смотреть что такое "reconstructible graph" в других словарях:
Reconstruction conjecture — Informally, the reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs. It is due to KellyKelly, P. J., [http://projecteuclid.org/getRecord?id=euclid.pjm/1103043674 A congruence theorem for trees] ,… … Wikipedia
Relation reduction — In logic and mathematics, relation reduction and relational reducibility have to do with the extent to which a given relation is determined by an indexed family or a sequence of other relations, called the relation dataset . The relation under… … Wikipedia
