## Abstract We shall prove that an oriented path is multiplicative if and only if it is homomorphically equivalent to a directed path. We shall also obtain some classes of digraphs that are nonmultiplicative.
Multiplicativity. Part I. Variations, multiplicative graphs, and digraphs
β Scribed by Huishan Zhou
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 791 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We study the multiplicativity and its variations of weak multiplicativity and very weak multiplicativity, analyze the role of connectivity condition in their definitions, and explore the relationship between them. New classes of multiplicative graphs and digraphs as well as weak multiplicative graphs and digraphs are obtained.
π SIMILAR VOLUMES
## Abstract It is well known that any planar graph contains at most __O__(__n__) complete subgraphs. We extend this to an exact characterization: __G__ occurs __O__(__n__) times as a subgraph of any planar graph, if and only if __G__ is threeβconnected. We generalize these results to similarly char
## Abstract In this paper we discuss a generalization of the familiar concept of an interval graph that arises naturally in scheduling and allocation problems. We define the interval number of a graph __G__ to be the smallest positive integer __t__ for which there exists a function __f__ which assi
Using multiplicities of eigenvalues of elliptic self-adjoint differential operators on graphs and transversality, we construct some new invariants of graphs which are related to tree-width.