Kratochvíl, Jan - Perfect Codes in General Graphs

Praha, Academia Nakladatelství, 1991. orig. wrappers. 24x16cm, 126 pp. Published in an edition of 500 copies.. ill.. Minor rubbing. VG. ¶ Contents: Introduction: Motivation; Classical perfect codes; Perfect codes in distance regular graphs; Perfect codes in general graphs: Packings, dominations sets and perfect codes; Perfect codes in a random graph; Perfect codes and Seidel's switching; Computational complexity of codes in graphs; Partitioning graphs into perfect codes; Perfect codes in Cartesian powers of graphs: Some nonexistence results; Second powers of self- complementary graphs; Perfect codes in the second power of a random graph; Perfect codes in the second power of trees; Final remarks and open problems.

See/Hide Conditions of Sale

Following conditions of sale apply:
Terms of Sale

Prices are listed in US Dollars. Insurance optional & extra. Uninsured parcels shipped at customer's risk.
Returns allowed within 14 days only if our description is faulty.