共查询到20条相似文献,搜索用时 12 毫秒
1.
Let G be a regular bipartite graph and . We show that there exist perfect matchings of G containing both, an odd and an even number of edges from X if and only if the signed graph , that is a graph G with exactly the edges from X being negative, is not equivalent to . In fact, we prove that for a given signed regular bipartite graph with minimum signature, it is possible to find perfect matchings that contain exactly no negative edges or an arbitrary one preselected negative edge. Moreover, if the underlying graph is cubic, there exists a perfect matching with exactly two preselected negative edges. As an application of our results we show that each signed regular bipartite graph that contains an unbalanced circuit has a 2‐cycle‐cover such that each cycle contains an odd number of negative edges. 相似文献
2.
研究3-正则图的一个有意义的问题是它是否存在k个没有共边的完美匹配.关于这个问题有一个著名的Fan-Raspaud猜想:每一个无割边的3-正则图都有3个没有共边的完美匹配.但这个猜想至今仍未解决.设dim(P(G))表示图G的完美匹配多面体的维数.本文证明了对于无割边的3-正则图G,如果dim(P(G))≤14,那么k≤4:如果dim(P(G))≤20,那么k≤5. 相似文献
3.
4.
Sanming Zhou 《Journal of Graph Theory》2014,75(1):37-47
Unitary graphs are arc‐transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of arc‐transitive graphs that admit an automorphism group acting imprimitively on the vertices. In this article, we prove that all unitary graphs are connected of diameter two and girth three. Based on this, we obtain, for any prime power , a lower bound of order on the maximum number of vertices in an arc‐transitive graph of degree and diameter two. 相似文献
5.
6.
王骁力 《数学物理学报(A辑)》2004,24(4):475-479
该文证明若G是2n阶均衡二分图,δ(G)≥(2n-1)/3,则对任何正整数k,n≥4k时,任给G的一个完美对集M,G中存在一个包含M的所有边的恰含k个分支的2 因子(k=1,n=5且δ(G)=3除外). 特别k=2时,在条件n≥5且δ(G)≥(n+2)/2下,结论也成立. 这里所给的δ(G)的下界是最好的可能.
相似文献
7.
A 1‐factorization of a graph G is a decomposition of G into edge‐disjoint 1‐factors (perfect matchings), and a perfect 1‐factorization is a 1‐factorization in which the union of any two of the 1‐factors is a Hamilton cycle. We consider the problem of the existence of perfect 1‐factorizations of even order 4‐regular Cayley graphs, with a particular interest in circulant graphs. In this paper, we study a new family of graphs, denoted , which are Cayley graphs if and only if k is even or . By solving the perfect 1‐factorization problem for a large class of graphs, we obtain a new class of 4‐regular bipartite circulant graphs that do not have a perfect 1‐factorization, answering a problem posed in 7 . With further study of graphs, we prove the nonexistence of P1Fs in a class of 4‐regular non‐bipartite circulant graphs, which is further support for a conjecture made in 7 . 相似文献
8.
Stephen G. Hartke Derrick Stolee Douglas B. West Matthew Yancey 《Journal of Graph Theory》2013,73(4):449-468
Let denote the maximum number of edges in a graph having n vertices and exactly p perfect matchings. For fixed p, Dudek and Schmitt showed that for some constant when n is at least some constant . For , they also determined and . For fixed p, we show that the extremal graphs for all n are determined by those with vertices. As a corollary, a computer search determines and for . We also present lower bounds on proving that for (as conjectured by Dudek and Schmitt), and we conjecture an upper bound on . Our structural results are based on Lovász's Cathedral Theorem. 相似文献
9.
For every d and k, we determine the smallest order of a vertex‐transitive graph of degree d and diameter k, and in each such case we show that this order is achieved by a Cayley graph. 相似文献
10.
Sergey Kitaev 《Journal of Graph Theory》2017,85(3):661-668
Recently, Jones et al. (Electron J Comb 22(2) (2015), #P2.53) introduced the study of u‐representable graphs, where u is a word over containing at least one 1. The notion of a u‐representable graph is a far‐reaching generalization of the notion of a word‐representable graph studied in the literature in a series of papers. Jones et al. have shown that any graph is 11???1‐representable assuming that the number of 1s is at least three, while the class of 12‐representable graphs is properly contained in the class of comparability graphs, which, in turn, is properly contained in the class of word‐representable graphs corresponding to 11‐representable graphs. Further studies in this direction were conducted by Nabawanda (M.Sc. thesis, 2015), who has shown, in particular, that the class of 112‐representable graphs is not included in the class of word‐representable graphs. Jones et al. raised a question on classification of u‐representable graphs at least for small values of u . In this article, we show that if u is of length at least 3 then any graph is u‐representable. This rather unexpected result shows that from existence of representation point of view there are only two interesting nonequivalent cases in the theory of u‐representable graphs, namely, those of and . 相似文献
11.
图$G$的$(\mathcal{O}_{k_1}, \mathcal{O}_{k_2})$-划分是将$V(G)$划分成两个非空子集$V_{1}$和$V_{2}$, 使得$G[V_{1}]$和$G[V_{2}]$分别是分支的阶数至多$k_1$和$k_2$的图.在本文中,我们考虑了有围长限制的平面图的点集划分问题,使得每个部分导出一个具有有界大小分支的图.我们证明了每一个围长至少为6并且$i$-圈不与$j$-圈相交的平面图允许$(\mathcal{O}_{2}$, $\mathcal{O}_{3})$-划分,其中$i\in\{6,7,8\}$和$j\in\{6,7,8,9\}$. 相似文献
12.
We prove that the number of 1‐factorizations of a generalized Petersen graph of the type is equal to the kth Jacobsthal number when k is odd, and equal to when k is even. Moreover, we verify the list coloring conjecture for . 相似文献
13.
Consider a graph G on n vertices satisfying the following Ore‐type condition: for any two nonadjacent vertices x and y of G, we have . We conjecture that if we color the edges of G with two colors then the vertex set of G can be partitioned to two vertex disjoint monochromatic cycles of distinct colors. In this article, we prove an asymptotic version of this conjecture. 相似文献
14.
We study the perfect 2‐colorings (also known as the equitable partitions into two parts or the completely regular codes with covering radius 1) of the Johnson graphs . In particular, we classify all the realizable quotient matrices of perfect 2‐colorings for odd v. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 21: 232–252, 2013 相似文献
15.
For each vertex of a simple polygon P an integer valued weight is given. We consider the path p1, p2, ..., pk in P which is created according to the following strategy: p1 is a designated start vertex s and pi+1 is obtained by choosing the vertex with smallest weight among all vertices visible from pi and different from p1, p2, ..., pi. If there is no such vertex the path is finished. This path is called geometric lexicographic dead end path. We shall prove the problem of determining whether a distinguished vertex t of P is on the geometric lexicographic dead end path or not to be P‐complete. 相似文献
16.
在文献[3]中介绍了一个新的图类-P3-支配图.这个图类包含所有的拟无爪图,因此也包含所有的无爪图.在本文中,我们证明了每一个点数至少是3的三角形连通的P3-支配图是哈密尔顿的,但有一个例外图K1,1,3.同时,我们也证明了k-连通的(k≥2)的P3-支配图是哈密尔顿的,如果an(G)≤k,但有两个例外图K1,1,3 and K2,3. 相似文献
17.
One of the classical problem in computational biology is the character compatibility problem or perfect phylogeny problem. A standard formulation of this problem in terms of two closely related questions is the following. Given a data set consisting
of a finite set X and a set
of partitions induced on X by a set of characters. Is
compatible, that is, does there exist an evolutionary tree that represents (in a well-defined sense) the data? If this is the case,
is this tree unique? A fundamental result in phylogenetics states that the answer to the former of the two questions is yes
precisely if the partition intersection graph
associated to
can be made chordal by obeying a certain rule.
The main insight from this paper is that the relation graph
associated to a set
of partitions may provide a key for deciding whether such a chordalization of
exists. To prove our results, we introduce an extension of the concept of the partition intersection graph associated to
using
.
Received August 27, 2004 相似文献
18.
We prove that the strong chromatic index of a 2‐degenerate graph is linear in the maximum degree Δ. This includes the class of all chordless graphs (graphs in which every cycle is induced) which in turn includes graphs where the cycle lengths are multiples of four, and settles a problem by Faudree et al. (Ars Combin 29(B) (1990), 205–211). © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 119–126, 2013 相似文献
19.
Mrinmoy Hota Madhumangal Pal Tapan K. Pal 《Computational Optimization and Applications》2001,18(1):49-62
The maximum weight k-independent set problem has applications in many practical problems like k-machines job scheduling problem, k-colourable subgraph problem, VLSI design layout and routing problem. Based on DAG (Directed Acyclic Graph) approach, an O(kn
2) time sequential algorithm is designed in this paper to solve the maximum weight k-independent set problem on weighted trapezoid graphs. The weights considered here are all non-negative and associated with each of the n vertices of the graph. 相似文献
20.
Toshimasa Ishii 《Journal of Graph Theory》2013,74(4):392-416
Given an undirected graph and an integer , we consider the problem of augmenting G by a minimum set of new edges so that the diameter becomes at most D. It is known that no constant factor approximation algorithms to this problem with an arbitrary graph G can be obtained unless , while the problem with only a few graph classes such as forests is approximable within a constant factor. In this article, we give the first constant factor approximation algorithm to the problem with an outerplanar graph G. We also show that if the target diameter D is even, then the case where G is a partial 2‐tree is also approximable within a constant. 相似文献