On total covers of graphs
β Scribed by Yousef Alavi; Jiuqiang Liu; Jianfang Wang; Zhongfu Zhang
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 292 KB
- Volume
- 100
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we consider total clique covers and intersection numbers on multifamilies. We determine the antichain intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the antichain intersection n
## Abstract In graph theory, the related problems of deciding when a set of vertices or a set of edges constitutes a maximum matching or a minimum covering have been extensively studied. In this paper we generalize these ideas by defining total matchings and total coverings, and show that these set
It is shown that if a graph has a cycle double cover, then its line graph also has a cycle double cover. The converse of this result for 2-edge-connected graphs would imply the truth of the cycle double cover conjecture. Cycle Double Cover Conjecture (CDCC). Every 2-edge-connected graph has a CDC.
Regular covers of complete graphs which are 2-arc-transitive are investigated. A classification is given of all such graphs whose group of covering transformations is either cyclic or isomorphic to Z p \_Z p , where p is a prime and whose fibrepreserving subgroup of automorphisms acts 2-arc-transiti