共查询到20条相似文献,搜索用时 15 毫秒
1.
Karola Mészáros 《Discrete Mathematics》2008,308(11):2149-2155
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1,…,vkof G there exists a cycle (respectively, hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability and posed the question of the existence of 3-regular 4-ordered (hamiltonian) graphs other than K4 and K3,3. Ng and Schultz observed that a 3-regular 4-ordered graph on more than 4 vertices is triangle free. We prove that a 3-regular 4-ordered graph G on more than 6 vertices is square free,and we show that the smallest graph that is triangle and square free, namely the Petersen graph, is 4-ordered. Furthermore, we prove that the smallest graph after K4 and K3,3 that is 3-regular 4-ordered hamiltonianis the Heawood graph. Finally, we construct an infinite family of 3-regular 4-ordered graphs. 相似文献
2.
In this paper we consider a graph optimization problem called minimum monopoly problem, in which it is required to find a minimum cardinality set S⊆V, such that, for each u∈V, |N[u]∩S|?|N[u]|/2 in a given graph G=(V,E). We show that this optimization problem does not have a polynomial-time approximation scheme for k-regular graphs (k?5), unless P=NP. We show this by establishing two L-reductions (an approximation preserving reduction) from minimum dominating set problem for k-regular graphs to minimum monopoly problem for 2k-regular graphs and to minimum monopoly problem for (2k-1)-regular graphs, where k?3. We also show that, for tree graphs, a minimum monopoly set can be computed in linear time. 相似文献
3.
Thomas Andreae 《Journal of Combinatorial Theory, Series B》1982,33(2):178-186
For each positive integer n, let Tn be the tree in which exactly one vertex has degree n and all the other vertices have degree n + 1. A graph G is called stable if its edge set is nonempty and if deleting an arbitrary edge of G there is always a component of the residue graph which is isomorphic to G. The question whether there are locally finite stable graphs that are not isomorphic to one of the graphs Tn is answered affirmatively by constructing an uncountable family of pairwise nonisomorphic, locally finite, stable graphs. Further, the following results are proved: (1) Among the locally finite trees containing no subdivision of T2, the oneway infinite path T1 is the only stable graph. (2) Among the locally finite graphs containing no two-way infinite path, T1 is also the only stable graph. 相似文献
4.
Xavier Dahan 《Combinatorica》2014,34(4):407-426
For every integer d≥10, we construct infinite families {G n } n∈? of d+1-regular graphs which have a large girth ≥log d |G n |, and for d large enough ≥1.33 · log d |G n |. These are Cayley graphs on PGL 2(F q ) for a special set of d+1 generators whose choice is related to the arithmetic of integral quaternions. These graphs are inspired by the Ramanujan graphs of Lubotzky-Philips-Sarnak and Margulis, with which they coincide when d is a prime. When d is not equal to the power of an odd prime, this improves the previous construction of Imrich in 1984 where he obtained infinite families {I n } n∈? of d + 1-regular graphs, realized as Cayley graphs on SL 2(F q ), and which are displaying a girth ≥0.48·log d |I n |. And when d is equal to a power of 2, this improves a construction by Morgenstern in 1994 where certain families {M n } n∈N of 2 k +1-regular graphs were shown to have girth ≥2/3·log2 k |M n |. 相似文献
5.
A graph G is locally s-regular if for any two s-arcs of G having the same head there exists a unique automorphism of G mapping the first of these s-arcs to the second. This is a natural generalization of the concept of an s-regular graph. We extend the results of [2] concerning s-regular graphs to this wider class. We also describe an example of a locally 7-regular cubic graph which is not 7-regular. 相似文献
6.
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sampling on the Erd?s‐Rényi random graph G(n,d/n), where each edge is chosen independently with probability d/n and d is fixed. While the average degree in G(n,d/n) is d(1 ‐ o(1)), it contains many nodes of degree of order log n/log log n. The existence of nodes of almost logarithmic degrees implies that for many natural distributions defined on G(n,p) such as uniform coloring (with a constant number of colors) or the Ising model at any fixed inverse temperature β, the mixing time of Gibbs sampling is at least n1+Ω(1/log log n). Recall that the Ising model with inverse temperature β defined on a graph G = (V,E) is the distribution over {±}Vgiven by . High degree nodes pose a technical challenge in proving polynomial time mixing of the dynamics for many models including the Ising model and coloring. Almost all known sufficient conditions in terms of β or number of colors needed for rapid mixing of Gibbs samplers are stated in terms of the maximum degree of the underlying graph. In this work, we show that for every d < ∞ and the Ising model defined on G (n, d/n), there exists a βd > 0, such that for all β < βd with probability going to 1 as n →∞, the mixing time of the dynamics on G (n, d/n) is polynomial in n. Our results are the first polynomial time mixing results proven for a natural model on G (n, d/n) for d > 1 where the parameters of the model do not depend on n. They also provide a rare example where one can prove a polynomial time mixing of Gibbs sampler in a situation where the actual mixing time is slower than npolylog(n). Our proof exploits in novel ways the local tree like structure of Erd?s‐Rényi random graphs, comparison and block dynamics arguments and a recent result of Weitz. Our results extend to much more general families of graphs which are sparse in some average sense and to much more general interactions. In particular, they apply to any graph for which every vertex v of the graph has a neighborhood N(v) of radius O(log n) in which the induced sub‐graph is a tree union at most O(log n) edges and where for each simple path in N(v) the sum of the vertex degrees along the path is O(log n). Moreover, our result apply also in the case of arbitrary external fields and provide the first FPRAS for sampling the Ising distribution in this case. We finally present a non Markov Chain algorithm for sampling the distribution which is effective for a wider range of parameters. In particular, for G(n, d/n) it applies for all external fields and β < βd, where d tanh(βd) = 1 is the critical point for decay of correlation for the Ising model on G(n, d/n). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009 相似文献
7.
A tree with at most m leaves is called an m-ended tree.Kyaw proved that every connected K1,4-free graph withσ4(G)n-1 contains a spanning 3-ended tree.In this paper we obtain a result for k-connected K1,4-free graphs with k 2.Let G be a k-connected K1,4-free graph of order n with k 2.Ifσk+3(G)n+2k-2,then G contains a spanning 3-ended tree. 相似文献
8.
WOODALL Douglas R 《中国科学A辑(英文版)》2009,52(5):973-980
It is conjectured that χas(G) = χt(G) for every k-regular graph G with no C5 component (k 2). This conjecture is shown to be true for many classes of graphs, including: graphs of type 1; 2-regular, 3-regular and (|V (G)| - 2)-regular graphs; bipartite graphs; balanced complete multipartite graphs; k-cubes; and joins of two matchings or cycles. 相似文献
9.
Kexiang Xu Jinlan Wang Hongshuang Liu 《Journal of Applied Mathematics and Computing》2014,45(1-2):365-374
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. The quasi-tree graph is a graph G in which there exists a vertex v∈V(G) such that G?v is a tree. In this paper, we presented the upper and lower bounds on the Harary index of all quasi-tree graphs of order n and characterized the corresponding extremal graphs. Moreover we defined the k-generalized quasi-tree graph to be a connected graph G with a subset V k ?V(G) where |V k |=k such that G?V k is a tree. And we also determined the k-generalized quasi-tree graph of order n with maximal Harary index for all values of k and the extremal one with minimal Harary index for k=2. 相似文献
10.
Michael D. Barrus 《Discrete Mathematics》2010,310(20):2600-2612
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of cards. A dacard specifies the degree of the deleted vertex along with the card. The degree-associated reconstruction number drn(G) is the minimum number of dacards that determine G. We show that drn(G)=2 for almost all graphs and determine when drn(G)=1. For k-regular n-vertex graphs, drn(G)≤min{k+2,n−k+1}. For vertex-transitive graphs (not complete or edgeless), we show that drn(G)≥3, give a sufficient condition for equality, and construct examples with large drn. Our most difficult result is that drn(G)=2 for all caterpillars except stars and one 6-vertex example. We conjecture that drn(G)≤2 for all but finitely many trees. 相似文献
11.
Genghua Fan 《Journal of Combinatorial Theory, Series B》1985,39(3):325-345
The paper is concerned with the longest cycles in regular three- (or two-) connected graphs. In particular, the following results are proved: (i) every 3-connected k-regular graph on n vertices has a cycle of length at least min(3k, n); (ii) every 2-connected k-regular graph on n vertices, where n < 3k + 4, has a cycle of length at least min(3k, n). 相似文献
12.
A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer [Some covering concepts in graphs, J. Combin. Theory 8 (1970) 91-98] defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perfect [1,2]-factor FG, i.e. a spanning subgraph such that each component is 1-regular or 2-regular. Here, we characterize all well-covered graphs G satisfying α(G)=α(FG) for some perfect [1,2]-factor FG. This class contains all well-covered graphs G without isolated vertices of order n with α?(n-1)/2, and in particular all very well-covered graphs. 相似文献
13.
Peter Mihók 《Discrete Mathematics》1981,37(1):123-126
For k?0, ?k(G) denotes the Lick-White vertex partition number of G. A graph G is called (n, k)-critical if it is connected and for each edge e of G?k(G–e)<?k(G)=n. We describe all (2, k)-critical graphs and for n?3,k?1 we extend and simplify a result of Bollobás and Harary giving one construction of a family of (n, k)-critical graphs of every possible order. 相似文献
14.
Jerrold W. Grossman 《Graphs and Combinatorics》1997,13(4):353-358
For a subset W of vertices of an undirected graph G, let S(W) be the subgraph consisting of W, all edges incident to at least one vertex in W, and all vertices adjacent to at least one vertex in W. If S(W) is a tree containing all the vertices of G, then we call it a spanning star tree of G. In this case W forms a weakly connected but strongly acyclic dominating set for G. We prove that for every r ≥ 3, there exist r-regular n-vertex graphs that have spanning star trees, and there exist r-regular n-vertex graphs that do not have spanning star trees, for all n sufficiently large (in terms of r). Furthermore, the problem of determining whether a given regular graph has a spanning star tree is NP-complete. 相似文献
15.
Karola Mészáros 《Discrete Mathematics》2008,308(12):2418-2426
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1,…,vk of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability, and motivated by the fact that k-orderedness of a graph implies (k-1)-connectivity, they posed the question of the existence of low degree k-ordered hamiltonian graphs. We construct an infinite family of graphs, which we call bracelet graphs, that are (k-1)-regular and are k-ordered hamiltonian for odd k. This result provides the best possible answer to the question of the existence of low degree k-ordered hamiltonian graphs for odd k. We further show that for even k, there exist no k-ordered bracelet graphs with minimum degree k-1 and maximum degree less than k+2, and we exhibit an infinite family of bracelet graphs with minimum degree k-1 and maximum degree k+2 that are k-ordered for even k. A concept related to k-orderedness, namely that of k-edge-orderedness, is likewise strongly related to connectivity properties. We study this relation and give bounds on the connectivity necessary to imply k-(edge-)orderedness properties. 相似文献
16.
A hamiltonian graph G of order n is k-ordered, 2 ≤ k ≤ n, if for every sequence v1, v2, …, vk of k distinct vertices of G, there exists a hamiltonian cycle that encounters v1, v2, …, vk in this order. Theorems by Dirac and Ore, presenting sufficient conditions for a graph to be hamiltonian, are generalized to k-ordered hamiltonian graphs. The existence of k-ordered graphs with small maximum degree is investigated; in particular, a family of 4-regular 4-ordered graphs is described. A graph G of order n ≥ 3 is k-hamiltonian-connected, 2 ≤ k ≤ n, if for every sequence v1, v2, …, vk of k distinct vertices, G contains a v1-vk hamiltonian path that encounters v1, v2,…, vk in this order. It is shown that for k ≥ 3, every (k + 1)-hamiltonian-connected graph is k-ordered and a result of Ore on hamiltonian-connected graphs is generalized to k-hamiltonian-connected graphs. © 1997 John Wiley & Sons, Inc. 相似文献
17.
Fengxia Liu 《Discrete Mathematics》2008,308(16):3711-3716
Let G=(V,E) be a simple connected graph and x∈V(G). The set {xg:g∈Aut(G)} is called an orbit of Aut(G). In this paper, we determine the edge connectivity of 3-regular and 4-regular connected graphs with two orbits, and prove the existence of k-regular m-edge-connected graphs with two orbits for some given integers k and m. Furthermore, we prove that the edge connectivity of a k-regular connected graph with two orbits and girth?5 attains its regular degree k. 相似文献
18.
Byung Kee Kim 《Journal of Applied Mathematics and Computing》2004,14(1-2):185-191
Given a connected graphG, we say that a setC ?V(G) is convex inG if, for every pair of verticesx, y ∈ C, the vertex set of everyx-y geodesic inG is contained inC. The convexity number ofG is the cardinality of a maximal proper convex set inG. In this paper, we show that every pairk, n of integers with 2 ≤k ≤ n?1 is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number ofk-regular graphs of ordern withn>k+1. 相似文献
19.
A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-connected, in short, super-λc, if the removal of any minimum cyclic edge-cut results in a component which is a shortest cycle. In [Zhang, Z., Wang, B.: Super cyclically edge-connected transitive graphs. J. Combin. Optim., 22, 549-562 (2011)], it is proved that a connected vertex-transitive graph is super-λc if G has minimum degree at least 4 and girth at least 6, and the authors also presented a class of nonsuper-λc graphs which have degree 4 and girth 5. In this paper, a characterization of k (k≥4)-regular vertex-transitive nonsuper-λc graphs of girth 5 is given. Using this, we classify all k (k≥4)-regular nonsuper-λc Cayley graphs of girth 5, and construct the first infinite family of nonsuper-λc vertex-transitive non-Cayley graphs. 相似文献
20.
MingChu Li 《Discrete Mathematics》2006,306(21):2682-2694
A known result obtained independently by Fan and Jung is that every 3-connected k-regular graph on n vertices contains a cycle of length at least min{3k,n}. This raises the question of how much can be said about the circumferences of 3-connected k-regular claw-free graphs. In this paper, we show that every 3-connected k-regular claw-free graph on n vertices contains a cycle of length at least min{6k-17,n}. 相似文献