首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
2.
A total cover of a graph G is a subset of V(G)E(G) which covers all elements of V(G)E(G). The total covering number 2(G) of a graph G is the minimum cardinality of a total cover in G. In [1], it is proven that 2(G)[n/2] for a connected graph G of order n. Here we consider the extremal case and give some properties of connected graphs which have a total covering number [n/2]. We prove that such a graph with even order has a 1-factor and such a graph with odd order is factor-critical.  相似文献   

3.
4.
A collection 𝒫 of n spanning subgraphs of the complete graph Kn is said to be an orthogonal double cover (ODC) if every edge of Kn belongs to exactly two members of 𝒫 and every two elements of 𝒫 share exactly one edge. We consider the case when all graphs in 𝒫 are isomorphic to some tree G and improve former results on the existence of ODCs, especially for trees G of short diameter and for trees of G on few vertices. © 1997 John Wiley & Sons, Inc. J Combin Designs 5:433–441, 1997  相似文献   

5.
A covering is a graph map ?: GH that is an isomorphism when restricted to the star of any vertex of G. If H is connected then |??1(v)| is constant. This constant is called the fold number. In this paper we prove that if G is a planar graph that covers a nonplanar H, then the fold number must be even.  相似文献   

6.
7.
8.
A cocycle (resp. cycle) cover of a graph G is a family C of cocycles (resp. cycles) of G such that each edge of G belongs to at least one member of C. The length of C is the sum of the cardinalities of its members. While it is known (see [5, 6]) that every bridgeless graph G = (V, E) has a cycle cover of length not greater than 53 |E|, it is shown that there exists no α < 2 such that every loopless graph G = (V, E) has a cocycle cover with length not greater than α |E|. To do this, cocycle covers of minimal length are determined for the complete graphs, thus solving a problem stated at the end of [6].  相似文献   

9.
We construct configuration spaces for cyclic covers of the projective line that admit extra automorphisms and we describe the locus of curves with given automorphism group. As an application we provide examples of arbitrary high genus that are defined over their field of moduli and are not hyperelliptic.  相似文献   

10.
A t-cover of a finite projective space ℙ is a set of t-dimensional subspaces covering all points of ℙ. Beutelspacher [1] constructed examples of t-covers and proved that his examples are of minimal cardinality. We shall show that all examples of minimal cardinality “look like” the examples of Beutelspacher.  相似文献   

11.
On covers of cyclic acts over monoids   总被引:1,自引:0,他引:1  
In (Bull. Lond. Math. Soc. 33:385–390, 2001) Bican, Bashir and Enochs finally solved a long standing conjecture in module theory that all modules over a unitary ring have a flat cover. The only substantial work on covers of acts over monoids seems to be that of Isbell (Semigroup Forum 2:95–118, 1971), Fountain (Proc. Edinb. Math. Soc. (2) 20:87–93, 1976) and Kilp (Semigroup Forum 53:225–229, 1996) who only consider projective covers. To our knowledge the situation for flat covers of acts has not been addressed and this paper is an attempt to initiate such a study. We consider almost exclusively covers of cyclic acts and restrict our attention to strongly flat and condition (P) covers. We give a necessary and sufficient condition for the existence of such covers and for a monoid to have the property that all its cyclic right acts have a strongly flat cover (resp. (P)-cover). We give numerous classes of monoids that satisfy these conditions and we also show that there are monoids that do not satisfy this condition in the strongly flat case. We give a new necessary and sufficient condition for a cyclic act to have a projective cover and provide a new proof of one of Isbell’s classic results concerning projective covers. We show also that condition (P) covers are not unique, unlike the situation for projective covers.  相似文献   

12.
We give a characterization of theE-unitary covers for a Bruck semigroup, which is a generalization of Theorem 3 given in [1]. In a recent paper [1] we gave a characterization of theE-unitary covers for a Bruck semigroupB(T,α) whereT is a finite chain of groups, and now we give a characterization forB(T,α) whereT is any inverse semigroup. We use here the notations and the terminology of Petrich's book [2]. First we prove a Theorem which is more general than [[1], Theorem 2]. I wish to express my thanks to Dr. G. Pollák for his valuable advice.  相似文献   

13.
Relationships between the following graph invariants are studied: The node clique cover number, θ0(>G); the clique cover number θ1(G); node independence number, β0(G); and an edge independence number, β1(G), We extend a theorem of Choudum, Parthasarathy and Ravindra with further statements equivalent to θ0(G) = θ1(G). More general results regarding the inequality θ0(G) ? 01(G) are presented.  相似文献   

14.
It is shown that each finite inverse monoid admits a finite F-inverse cover if and only if the same is true for each finite combinatorial strict inverse semigroup with an identity adjoined if and only if the same is true for the Margolis-Meakin expansion M(H) of each finite elementary abelian p-group H for some prime p. Additional equivalent conditions are given in terms of the existence of locally finite varieties of groups having certain properties. Ultimately, the problem of whether each finite inverse monoid admits a finite F-inverse cover, is reduced to a question concerning the Kostrikin-Zelmanov varieties Kn of all locally finite groups of exponent dividing n.  相似文献   

15.
We determine the fundamental group of the complement of the three-cuspidal quartic minus the tangent lines through the cusps. The existence of a rigid covering of this complement whose monodromy group is isomorphic to the simple group PSL2(\mathbbF7)\mathrm{PSL}_{2}(\mathbb{F}_{7}) is proved.  相似文献   

16.
This paper is devoted to efficient sequential estimation in stochastic processes whose corresponding sufficient statistics are processes with stationary independent increments. It is proved that a stopping time is efficient if and only if it represents a time of the first attaining of a hyperplane., which cannot ‘be passed’, in the sense which is made precise below. The problem of determining the explicit form of the hyperplanes which cannot ‘be passed’ is also discussed.  相似文献   

17.
This note discusses the existence of non-negative non-constant harmonic functions on co-compact covers with linear deck group. Conferenza tenuta da P. Bougerol il 4 ottobre 1993  相似文献   

18.
19.
20.
We show that there are knots whose infinite cyclic covers do not embed in any compact 3-manifold, answering a question of Jiang et al. (2006).  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号