## Background Recently, some remarkable connections between commutative algebra and combinatorics have been discovered. Among the main topics in this area are the concepts of Cohen-Macaulay and Gorenstein complexes. Recall some basic definitions. Let V = {x1, x2, . . . , x,} be a finite set and A
✦ LIBER ✦
On a graph theoretical basis for ordering of structures
✍ Scribed by Milan Randić; Charles L. Wilkins
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 523 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0009-2614
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A graph-theoretical characterization of
✍
Takayuki Hibi; Hiroshi Narushima; Morimasa Tsuchiya; Kei-ichi Watanabe
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 376 KB
Theoretical basis of boundary solutions
✍
Artur Portela
📂
Article
📅
1981
🏛
Elsevier Science
🌐
English
⚖ 293 KB
A graph theoretic approach to the groupi
✍
L. D. Bodin
📂
Article
📅
1972
🏛
John Wiley and Sons
🌐
English
⚖ 217 KB
Observability analysis for structured bi
✍
T. Boukhobza; F. Hamelin
📂
Article
📅
2007
🏛
Elsevier Science
🌐
English
⚖ 241 KB
Theoretical basis for variable order ass
✍
David G. Dixon; James L. Hendrix
📂
Article
📅
1993
🏛
American Institute of Chemical Engineers
🌐
English
⚖ 232 KB
On the Order of a Minimal Additive Basis
✍
Georges Grekos
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 130 KB
Let A be a set of non-negative integers. If every sufficiently large integer is the sum of h not necessarily distinct elements of A, then A is called an asymptotic basis of order h. An asymptotic basis A of order h is called minimal if no proper subset of A is an asymptotic basis of order h. It is p