Boolean distance for graphs

DOI10.1016/0012-365X(82)90135-2zbMath0477.05043OpenAlexW2067720770MaRDI QIDQ1160140

Uri N. Peled, Frank Harary, Robert A. Melter, Ioan Tomescu

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90135-2

zbMATH Keywords

block-cutpoint graphboolean distance

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Boolean Metric Spaces and Boolean Algebraic Varieties, Binary clustering, Graph theory (algorithmic, algebraic, and metric problems)

Cites Work

• Parallel concepts in graph theory
• Boolean valued rings and Boolean metric spaces
• The cutting center theorem for trees
• Unnamed Item