共查询到20条相似文献,搜索用时 31 毫秒
1.
The theory of vertex-disjoint cycles and 2-factors of graphs is the extension and generation of the well-known Hamiltonian cycles theory and it has important applications in network communication. In this paper we first prove the following result. Let G=(V 1,V 2;E) be a bipartite graph with |V 1|=|V 2|=n such that n≥2k+1, where k≥1 is an integer. If d(x)+d(y)≥?(4n+2k?1)/3? for each pair of nonadjacent vertices x and y of G with x∈V 1 and y∈V 2, then, for any k independent edges e 1,…,e k of G, G contains k vertex-disjoint quadrilaterals C 1,…,C k such that e i ∈E(C i ) for each i∈{1,…,k}. We further show that the degree condition above is sharp. If |V 1|=|V 2|=2k, we give degree conditions that G has a 2-factor with k vertex-disjoint quadrilaterals C 1,…,C k containing specified edges of G. 相似文献
2.
Let k≥1 be an integer and G=(V 1,V 2;E) a bipartite graph with |V 1|=|V 2|=n such that n≥2k+2. Our result is as follows: If $d(x)+d(y)\geq \lceil\frac{4n+k}{3}\rceil$ for any nonadjacent vertices x∈V 1 and y∈V 2, then for any k distinct vertices z 1,…,z k , G contains a 2-factor with k+1 cycles C 1,…,C k+1 such that z i ∈V(C i ) and l(C i )=4 for each i∈{1,…,k}. 相似文献
3.
A seagull in a graph is an induced three-vertex path. When does a graph G have k pairwise vertex-disjoint seagulls? This is NP-complete in general, but for graphs with no stable set of size three we give a complete solution. This case is of special interest because of a connection with Hadwiger’s conjecture which was the motivation for this research; and we deduce a unification and strengthening of two theorems of Blasiak [2] concerned with Hadwiger’s conjecture. Our main result is that a graph G (different from the five-wheel) with no three-vertex stable set contains k disjoint seagulls if and only if
- |V (G)|≥3k
- G is k-connected
- for every clique C of G, if D denotes the set of vertices in V (G)\C that have both a neighbour and a non-neighbour in C then |D|+|V (G)\C|≥2k, and
- the complement graph of G has a matching with k edges.
4.
A cycle of a bipartite graphG(V+, V?; E) is odd if its length is 2 (mod 4), even otherwise. An odd cycleC is node minimal if there is no odd cycleC′ of cardinality less than that ofC′ such that one of the following holds:C′ ∩V + ?C ∩V + orC′ ∩V ? ?C ∩V ?. In this paper we prove the following theorem for bipartite graphs: For a bipartite graphG, one of the following alternatives holds: -All the cycles ofG are even. -G has an odd chordless cycle. -For every node minimal odd cycleC, there exist four nodes inC inducing a cycle of length four. -An edge (u, v) ofG has the property that the removal ofu, v and their adjacent nodes disconnects the graphG. To every (0, 1) matrixA we can associate a bipartite graphG(V+, V?; E), whereV + andV ? represent respectively the row set and the column set ofA and an edge (i,j) belongs toE if and only ifa ij = 1. The above theorem, applied to the graphG(V+, V?; E) can be used to show several properties of some classes of balanced and perfect matrices. In particular it implies a decomposition theorem for balanced matrices containing a node minimal odd cycleC, having the property that no four nodes ofC induce a cycle of length 4. The above theorem also yields a proof of the validity of the Strong Perfect Graph Conjecture for graphs that do not containK 4?e as an induced subgraph. 相似文献
5.
The following Theorem is proved:Let K be a finitely generated field over its prime field. Then, for almost all e-tuples (σ)=(σ 1, …,σ e)of elements of the abstract Galois group G(K)of K we have:
- If e=1,then E tor(K(σ))is infinite. Morover, there exist infinitely many primes l such that E(K(σ))contains points of order l.
- If e≧2,then E tor(K(σ))is finite.
- If e≧1,then for every prime l, the group E(K(σ))contains only finitely many points of an l-power order.
6.
7.
Yoshimi Egawa Hikoe Enomoto Ralph J. Faudree Hao Li Ingo Schiermeyer 《Journal of Graph Theory》2003,43(3):188-198
It is shown that if G is a graph of order n with minimum degree δ(G), then for any set of k specified vertices {v1,v2,…,vk} ? V(G), there is a 2‐factor of G with precisely k cycles {C1,C2,…,Ck} such that vi ∈ V(Ci) for (1 ≤ i ≤ k) if or 3k + 1 ≤ n ≤ 4k, or 4k ≤ n ≤ 6k ? 3,δ(G) ≥ 3k ? 1 or n ≥ 6k ? 3, . Examples are described that indicate this result is sharp. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 188–198, 2003 相似文献
8.
Mirko Lepović 《Journal of Applied Mathematics and Computing》2003,11(1-2):109-122
A tree is called starlike if it has exactly one vertex of degree greater than two. In [4] it was proved that two starlike treesG andH are cospectral if and only if they are isomorphic. We prove here that there exist no two non-isomorphic Laplacian cospectral starlike trees. Further, letG be a simple graph of ordern with vertex setV(G)={1,2, …,n} and letH={H 1,H 2, ...H n } be a family of rooted graphs. According to [2], the rooted productG(H) is the graph obtained by identifying the root ofH i with thei-th vertex ofG. In particular, ifH is the family of the paths $P_{k_1 } , P_{k_2 } , ..., P_{k_n } $ with the rooted vertices of degree one, in this paper the corresponding graphG(H) is called the sunlike graph and is denoted byG(k 1,k 2, …,k n ). For any (x 1,x 2, …,x n ) ∈I * n , whereI *={0,1}, letG(x 1,x 2, …,x n ) be the subgraph ofG which is obtained by deleting the verticesi 1, i2, …,i j ∈ V(G) (0≤j≤n), provided that $x_{i_1 } = x_{i_2 } = ... = x_{i_j } = 0$ . LetG(x 1,x 2,…, x n] be the characteristic polynomial ofG(x 1,x 2,…, x n ), understanding thatG[0, 0, …, 0] ≡ 1. We prove that $$G[k_1 , k_2 ,..., k_n ] = \Sigma _{x \in ^{I_ * ^n } } \left[ {\Pi _{i = 1}^n P_{k_i + x_i - 2} (\lambda )} \right]( - 1)^{n - (\mathop \Sigma \limits_{i = 1}^n x_i )} G[x_1 , x_2 , ..., x_n ]$$ where x=(x 1,x 2,…,x n );G[k 1,k 2,…,k n ] andP n (γ) denote the characteristic polynomial ofG(k 1,k 2,…,k n ) andP n , respectively. Besides, ifG is a graph with λ1(G)≥1 we show that λ1(G)≤λ1(G(k 1,k 2, ...,k n )) < for all positive integersk 1,k 2,…,k n , where λ1 denotes the largest eigenvalue. 相似文献
9.
LetG = (X, E) be a simple graph of ordern, of stability numberα and of connectivityk withα ≤ k. The Chvátal-Erdös's theorem [3] proves thatG is hamiltonian. We have investigated under these conditions what can be said about the existence of cycles of lengthl. We have obtained several results:
- IfG ≠ K k,k andG ≠ C 5,G has aC n?1 .
- IfG ≠ C 5, the girth ofG is at most four.
- Ifα = 2 and ifG ≠ C 4 orC 5,G is pancyclic.
- Ifα = 3 and ifG ≠ K 3,3,G has cycles of any length between four andn.
- IfG has noC 3,G has aC n?2 .
10.
V. É. Geit 《Mathematical Notes》1971,10(5):768-776
We prove the following: for every sequence {Fv}, Fv ? 0, Fv > 0 there exists a functionf such that
- En(f)?Fn (n=0, 1, 2, ...) and
- Akn?k? v=1 n vk?1 Fv?1?Ωk (f, n?1) (n=1, 2, ...).
11.
Lutz Volkmann 《Aequationes Mathematicae》2016,90(2):271-279
Let G be a graph with vertex set V(G). For any integer k ≥ 1, a signed total k-dominating function is a function f: V(G) → {?1, 1} satisfying ∑x∈N(v)f(x) ≥ k for every v ∈ V(G), where N(v) is the neighborhood of v. The minimum of the values ∑v∈V(G)f(v), taken over all signed total k-dominating functions f, is called the signed total k-domination number. In this note we present some new sharp lower bounds on the signed total k-domination number of a graph. Some of our results improve known bounds. 相似文献
12.
Hong Wang 《Journal of Graph Theory》1997,26(2):105-109
We propose a conjecture: for each integer k ≥ 2, there exists N(k) such that if G is a graph of order n ≥ N(k) and d(x) + d(y) ≥ n + 2k - 2 for each pair of non-adjacent vertices x and y of G, then for any k independent edges e1, …, ek of G, there exist k vertex-disjoint cycles C1, …, Ck in G such that ei ∈ E(Ci) for all i ∈ {1, …, k} and V(C1 ∪ ···∪ Ck) = V(G). If this conjecture is true, the condition on the degrees of G is sharp. We prove this conjecture for the case k = 2 in the paper. © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 105–109, 1997 相似文献
13.
For a graph G, we define σ2(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ2(G) ≥ n + k − 1, then for any set of k independent vertices v
1,...,v
k
, G has k vertex-disjoint cycles C
1,..., C
k
of length at most four such that v
i
∈ V(C
i
) for all 1 ≤ i ≤ k. And show if σ2(G) ≥ n + k − 1, then for any set of k independent vertices v
1,...,v
k
, G has k vertex-disjoint cycles C
1,..., C
k
such that v
i
∈ V(C
i
) for all 1 ≤ i ≤ k, V(C
1) ∪...∪ V(C
k
) = V(G), and |C
i
| ≤ 4 for all 1 ≤ i ≤ k − 1.
The condition of degree sum σ2(G) ≥ n + k − 1 is sharp.
Received: December 20, 2006. Final version received: December 12, 2007. 相似文献
14.
Lutz Volkmann 《Central European Journal of Mathematics》2014,12(3):517-528
Let k ≥ 2 be an integer. A function f: V(G) → {?1, 1} defined on the vertex set V(G) of a graph G is a signed k-independence function if the sum of its function values over any closed neighborhood is at most k ? 1. That is, Σ x∈N[v] f(x) ≤ k ? 1 for every v ∈ V(G), where N[v] consists of v and every vertex adjacent to v. The weight of a signed k-independence function f is w(f) = Σ v∈V(G) f(v). The maximum weight w(f), taken over all signed k-independence functions f on G, is the signed k-independence number α s k (G) of G. In this work, we mainly present upper bounds on α s k (G), as for example α s k (G) ≤ n ? 2?(Δ(G) + 2 ? k)/2?, and we prove the Nordhaus-Gaddum type inequality $\alpha _S^k \left( G \right) + \alpha _S^k \left( {\bar G} \right) \leqslant n + 2k - 3$ , where n is the order, Δ(G) the maximum degree and $\bar G$ the complement of the graph G. Some of our results imply well-known bounds on the signed 2-independence number. 相似文献
15.
Peter J. Slater 《Discrete Applied Mathematics》1981,3(3):187-192
An ordered n-tuple (vi1,vi2,…,vin) is called a sequential labelling of graph G if {vi1,vi2,…,vin} = V(G) and the subgraph induced by {vi1,vi2,…, vij} is connected for 1≤j≤n. Let σ(v;G) denote the number of sequential labellings of G with vi1=v. Vertex v is defined to be an accretion center of G if σ is maximized at v. This is shown to generalize the concept of a branch weight centroid of a tree since a vertex in a tree is an accretion center if and only if it is a centroid vertex. It is not, however, a generalization of the concept of a median since for a general graph an accretion center is not necessarily a vertex of minimum distance. A method for computing σ(v;G) based upon edge contractions is described. 相似文献
16.
In 2001, Kawarabayashi proved that for any odd integer k ≥ 3, if a k-connected graph G is \({K^{-}_{4}}\) -free, then G has a k-contractible edge. He pointed out, by a counterexample, that this result does not hold when k is even. In this paper, we have proved the following two results on the subject: (1) For any even integer k ≥ 4, if a k-connected graph G is \({K_{4}^{-}}\) -free and d G (x) + d G (y) ≥ 2k + 1 hold for every two adjacent vertices x and y of V(G), then G has a k-contractible edge. (2) Let t ≥ 3, k ≥ 2t – 1 be integers. If a k-connected graph G is \({(K_{1}+(K_{2} \cup K_{1, t}))}\) -free and d G (x) + d G (y) ≥ 2k + 1 hold for every two adjacent vertices x and y of V(G), then G has a k-contractible edge. 相似文献
17.
Yuri Bilu 《Israel Journal of Mathematics》1995,90(1-3):235-252
LetK be an algebraic number field,S?S \t8 a finite set of valuations andC a non-singular algebraic curve overK. Letx∈K(C) be non-constant. A pointP∈C(K) isS-integral if it is not a pole ofx and |x(P)| v >1 impliesv∈S. It is proved that allS-integral points can be effectively determined if the pair (C, x) satisfies certain conditions. In particular, this is the case if
- x:C→P 1 is a Galois covering andg(C)≥1;
- the integral closure of $\bar Q$ [x] in $\bar Q$ (C) has at least two units multiplicatively independent mod $\bar Q$ *.
18.
A set W of the vertices of a connected graph G is called a resolving set for G if for every two distinct vertices u, v ∈ V (G) there is a vertex w ∈ W such that d(u, w) ≠ d(v, w). A resolving set of minimum cardinality is called a metric basis for G and the number of vertices in a metric basis is called the metric dimension of G, denoted by dim(G). For a vertex u of G and a subset S of V (G), the distance between u and S is the number min s∈S d(u, s). A k-partition Π = {S 1 , S 2 , . . . , S k } of V (G) is called a resolving partition if for every two distinct vertices u, v ∈ V (G) there is a set S i in Π such that d(u, Si )≠ d(v, Si ). The minimum k for which there is a resolving k-partition of V (G) is called the partition dimension of G, denoted by pd(G). The circulant graph is a graph with vertex set Zn , an additive group of integers modulo n, and two vertices labeled i and j adjacent if and only if i-j (mod n) ∈ C , where CZn has the property that C =-C and 0 ■ C. The circulant graph is denoted by Xn, Δ where Δ = |C|. In this paper, we study the metric dimension of a family of circulant graphs Xn, 3 with connection set C = {1, n/2 , n-1} and prove that dim(Xn, 3 ) is independent of choice of n by showing that dim(Xn, 3 ) ={3 for all n ≡ 0 (mod 4), 4 for all n ≡ 2 (mod 4). We also study the partition dimension of a family of circulant graphs Xn,4 with connection set C = {±1, ±2} and prove that pd(Xn, 4 ) is independent of choice of n and show that pd(X5,4 ) = 5 and pd(Xn,4 ) ={3 for all odd n ≥ 9, 4 for all even n ≥ 6 and n = 7. 相似文献
19.
In 2000, Enomoto and Ota [J Graph Theory 34 (2000), 163–169] stated the following conjecture. Let G be a graph of order n, and let n1, n2, …, nk be positive integers with \begin{eqnarray*}\sum\nolimits_{{{i}} = {{1}}}^{{{k}}} {{n}}_{{{i}}} = {{n}}\end{eqnarray*}. If σ2(G)≥n+ k?1, then for any k distinct vertices x1, x2, …, xk in G, there exist vertex disjoint paths P1, P2, …, Pk such that |Pi|=ni and xi is an endpoint of Pi for every i, 1≤i≤k. We prove an asymptotic version of this conjecture in the following sense. For every k positive real numbers γ1, …, γk with \begin{eqnarray*}\sum\nolimits_{{{i}} = {{1}}}^{{{k}}} \gamma_{{{i}}} = {{1}}\end{eqnarray*}, and for every ε>0, there exists n0 such that for every graph G of order n≥n0 with σ2(G)≥n+ k?1, and for every choice of k vertices x1, …, xk∈V(G), there exist vertex disjoint paths P1, …, Pk in G such that \begin{eqnarray*}\sum\nolimits_{{{i}} = {{1}}}^{{{k}}} |{{P}}_{{{i}}}| = {{n}}\end{eqnarray*}, the vertex xi is an endpoint of the path Pi, and (γi?ε)n<|Pi|<(γi + ε)n for every i, 1≤i≤k. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 37–51, 2010 相似文献
20.
Lutz Volkmann 《Aequationes Mathematicae》2013,86(3):279-287
Let G be a graph with vertex set V(G), and let f : V(G) → {?1, 1} be a two-valued function. If k ≥ 1 is an integer and ${\sum_{x\in N[v]} f(x) \ge k}$ for each ${v \in V(G)}$ , where N[v] is the closed neighborhood of v, then f is a signed k-dominating function on G. A set {f 1,f 2, . . . ,f d } of distinct signed k-dominating functions on G with the property that ${\sum_{i=1}^d f_i(x) \le k}$ for each ${x \in V(G)}$ , is called a signed (k, k)-dominating family (of functions) on G. The maximum number of functions in a signed (k, k)-dominating family on G is the signed (k, k)-domatic number of G. In this article we mainly present upper bounds on the signed (k, k)-domatic number, in particular for regular graphs. 相似文献