Boolean distance for graphs
dc.contributor.author | Harary, Frank | en_US |
dc.contributor.author | Melter, Robert A. | en_US |
dc.contributor.author | Peled, Uri N. | en_US |
dc.contributor.author | Tomescu, Ioan | en_US |
dc.date.accessioned | 2006-04-07T17:56:15Z | |
dc.date.available | 2006-04-07T17:56:15Z | |
dc.date.issued | 1982 | en_US |
dc.identifier.citation | Harary, Frank, Melter, Robert A., Peled, Uri N., Tomescu, Ioan (1982)."Boolean distance for graphs." Discrete Mathematics 39(2): 123-127. <http://hdl.handle.net/2027.42/24097> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V00-45MGKDM-2/2/581a22599d2a5a6d6df13f7736b18629 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/24097 | |
dc.description.abstract | The boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (O if X = y). It is determined in terms of the block-cutpoint graph of G, and shown to satisfy the triangle inequality b(x,y)[subset of or equal to] b(x, z)[union or logical sum]b(z,y). We denote by B(G) the collection of distinct boolean distances of G and by M(G) the multiset of the distances together with the number of occurrences of each of them. Then where b is the number of blocks of G. A combinatorial characterization is given for B(T) where T is a tree. Finally, G is reconstructible from M(G) if and only if every block of G is a line or a triangle. | en_US |
dc.format.extent | 589697 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Boolean distance for graphs | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, MI 48109, USA | en_US |
dc.contributor.affiliationother | Department of Mathematics, Southampton College of Long Island University, Southampton, NY 11968, USA | en_US |
dc.contributor.affiliationother | Computer Science Department, Columbia University, New York, NY 10027, USA | en_US |
dc.contributor.affiliationother | Faculty of Mathematics, University of Bucharest, Bucharest, Romania | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/24097/1/0000354.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(82)90135-2 | en_US |
dc.identifier.source | Discrete Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
-
Interdisciplinary and Peer-Reviewed
-
Mathematical Geography, Institute of (IMaGe)
Publications and Scholarly Research Projects.
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.