It has been proved that if the diameter D of a digraph G satisfies D Υ 2α Οͺ 2, where α is a parameter which can be thought of as a generalization of the girth of a graph, then G is superconnected. Analogously, if D Υ 2α Οͺ 1, then G is edge-superconnected. In this paper, we studied some similar condi
The recognition of indifference digraphs and generalized semiorders
β Scribed by Steiner, George
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 434 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
A digraph is an interval digraph if each vertex can be assigned a source interval and a sink interval on the real line such that there is an edge from u to u if and only if the source interval for u intersects the sink interval for u . A digraph is an indifference digraph or unit interval digraph if and only if such a representation can be constructed in which every source and sink interval has unit length. We present a new characterization and an efficient recognition algorithm for indifference digraphs and generalized semiorders.
π SIMILAR VOLUMES
## Abstract The recognition heuristic is claimed to be distinguished from notions of availability and fluency through its categorical or βbinaryβ treatment of information and the βinconsequentialityβ of further knowledge to inferences based on recognition. Using the cityβsize task of Goldstein and
Based on the concept that the framework structure of a protein is determined by its secondary structure sequence, a new method for recognition and prediction of the structural class is suggested. By use of parameters N β£ , N β€ , and N β€β£β€ (the number of β£-helices, β€-strands, and β€β£β€ fragments), one