Möbius inversion on a poset of a graph and its acyclic subgraphs
✍ Scribed by D. Babić; N. Trinajstić
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 410 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The generalized Mo¨bius function and Mo¨bius inversion formula are applied to a multiplicative semigroup. A general mathematical method based on this Mo¨bius inversion is presented to solve inversion problems of expansions with unequally weighted terms. By this method, all the inverse lattice proble
## Abstract For a graphb __F__ without isolated vertices, let __M__(__F__; __n__) denote the minimum number of monochromatic copies of __F__ in any 2‐coloring of the edges of __K__~__n__~. Burr and Rosta conjectured that when __F__ has order __t__, size __u__, and __a__ automorphisms. Independent