Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6872089 | Discrete Applied Mathematics | 2015 | 11 Pages |
Abstract
We give a complete characterization of bipartite graphs having tree-like Galois lattices. We prove that the poset obtained by deleting bottom and top elements from the Galois lattice of a bipartite graph is tree-like if and only if the graph is a bipartite distance hereditary graph. Relations with the class of Ptolemaic graphs are discussed and exploited to give an alternative proof of the result.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Nicola Apollonio, Massimiliano Caramia, Paolo Giulio Franciosa,