Boolean distance for graphs

DOI10.1016/0012-365X(82)90135-2zbMATH Open0477.05043OpenAlexW2067720770MaRDI QIDQ1160140FDOQ1160140

Authors: Frank Harary, Robert A. Melter, Uri N. Peled, 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

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

Cites Work

• Title not available (Why is that?)
• Parallel concepts in graph theory
• The cutting center theorem for trees
• Boolean valued rings and Boolean metric spaces

Cited In (3)

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

This page was built for publication: Boolean distance for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160140)