Poset graphs and the lattice of graph annihilators
β Scribed by LaGrange, John D.; Roy, Kyle A.
- Book ID
- 120536344
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 449 KB
- Volume
- 313
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Usually __dimension__ should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [__t__βββ1 β __t__], thought to be between __t__βββ1 and __t__. We have the following two results: (a) a graph is outerplanar if and only if its
A t-box representation of a graph encodes each vertex as a box in t-space determined by the (integer) coordinates of its lower and upper corner, such that vertices are adjacent if and only if the corresponding boxes intersect. The boxicity of a graph G is the minirmlm t for which this can be done; e
A notion of parallelism is defined in finite median graphs and a number of properties about geodesics and the existence of cubes are obtained. Introducing sites as a double structure of partial order and graph on a set, it is shown that all median graphs can be constructed from sites and, in fact, t