For a given graphical invariant K, a sequence (a, , , a,, . . . , a, ) of positive integers is said to be r-feasible if there exists a graph G with distinguished vertices ul, u2, . . . , v, such that T( G) = a. and T( G -u1 -v2 ---v i ) = ai for i = 1, 2, . . . , n . In this paper, we investigate r-
Monotone sequences of graphical invariants
β Scribed by Frank Harary; Jerald A. Kabell
- Publisher
- John Wiley and Sons
- Year
- 1980
- Tongue
- English
- Weight
- 145 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A converse of the well known Cesaro method has been demonstrated to accelerate successfully various monotonic sequences of practical concern. The method is simple, regular and particularly apt for low-order data. Pilot calculations highlighting the workability in varying practical contexts involve a
## Abstract We consider a 2D graphical representations of DNA sequences, which avoids loss of information associated with crossing and overlapping of the corresponding curve. We outline an approach, which is based on the construction of a threeβcomponent vector whose components are the normalized l
In this article we present a new version of the ErdGs-Gallai theorem concerning graphicness of the degree sequences. The best conditions of all known on the reduction of the number of Erdiis-Gallai inequalities are given. Moreover, we prove a criterion of the bipartite graphicness and give a suffic
## Abstract On the basis of information on the evolution of the 20 amino acids and their physiochemical characteristics, we propose a new twoβdimensional (2D) graphical representation of protein sequences in this article. By this representation method, we use 2D data to represent threeβdimensional