## Abstract Let ϕ be a symmetric binary function, positive valued on positive arguments. A graph __G__ = (__V__,__E__) is a ϕ‐__tolerance graph__ if each vertex υ ∈ __V__ can be assigned a closed interval __I__~υ~ and a positive tolerance __t__~υ~ so that __xy__ ∈ __E__ ⇔ | __I__~x~ ∩ __I__~y~|≥ ϕ
Two-φ-tolerance competition graphs
✍ Scribed by R.C. Brigham; F.R. McMorris; R.P. Vitray
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 505 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper, we introduce a class of graphs that generalize threshold graphs by introducing threshold tolerances. Several characterizations of these graphs are presented, one of which leads to a polynomial-time recognition algorithm. It is also shown that the complements of these graphs contain in
We show that, if a tolerance graph is the complement of a comparability graph, it is a trapezoid graph, i.e., the complement of an order of interval dimension at most 2. As consequences we are able to give obstructions for the class of bounded tolerance graphs and to give an example of a graph that