Asymptotic number of isometric generalized Fibonacci cubes

For a binary word f, let Q_d(f) be the subgraph of the d-dimensional cube Q_d induced on the set of all words that do not contain f as a factor. Let G_n be the set of words f of length n that are good in the sense that Q_d(f) is isometric in Q_d for all d. It is proved that lim_n→∞|G_n|/2ⁿ exists. Estimates show that the limit is close to 0.08, that is, about eight percent of all words are good.     

Graphs Having (2 mod d)-Cycles

It is known that if G is a graph with minimum degree δ at least d+1, then G has a cycle of length 2 mod d. We show that if G is also bipartite, then G has a cycle of length 2 mod 2d. Both these bounds are tight in terms of minimum degree. However, we show that if G is a graph with δ ≥ d and had neither K_d nor K_d,d as an induced subgraph, then G has a cycle of length 2 mod d. If G is also bipartite, then G has a cycle of length 2 mod 2d. If G is a 2-connected graph with δ ≥ d and is not congruent to K_d nor K_d,d' (for d' ≥ d) then G has a cycle of length 2 mod d. If G is also bipartite, then G has a cycle of length 2 mod 2d.     

Hypercube subgraphs with minimal detours

Define a minimal detour subgraph of the n-dimensional cube to be a spanning subgraph G of Q_n having the property that for vertices x, y of Q_n, distances are related by d_G(x, y) ≤ d_Qn(x, y) + 2. Let f(n) be the minimum number of edges of such a subgraph of Q_n. After preliminary work on distances in subgraphs of product graphs, we show that The subgraphs we construct to establish this bound have the property that the longest distances are the same as in Q_n, and thus the diameter does not increase. We establish a lower bound for f(n), show that vertices of high degree must be distributed throughout a minimal detour subgraph of Q_n, and end with conjectures and questions. © 1996 John Wiley & Sons, Inc.     

Lower bounds on the independence number in terms of the degrees

Wei discovered that the independence number of a graph G is at least Σ_v(1 + d(v))^?1. It is proved here that if G is a connected triangle-free graph on n ≥ 3 vertices and if G is neither an odd cycle nor an odd path, then the bound above can be increased by $\text{n}\text{Δ(Δ + 1)}$, where Δ is the maximum degree. This new bound is sharp for even cycles and for three other graphs. These results relate nicely to some algorithms for finding large independent sets. They also have a natural matrix theory interpretation. A survey of other known lower bounds on the independence number is presented.     

Long Cycles Generate the Cycle Space of a Graph

Let G be a 2-connected graph in which the degree of every vertex is at least d. We prove that the cycles of length at least d + 1 generate the cycle space of G, unless G ≌ K_d+1 and d is odd. As a corollary, we deduce that the cycles of length at least d + 1 generate the subspace of even cycles in G. We also establish the existence of odd cycles of length at least d + 1 in the case when G is not bipartite.A second result states: if G is 2-connected with chromatic number at least k, then the cycles of length at least k generate the cycle space of G, unless G ≌ K_k and k is even. Similar corollaries follow, among them a stronger version of a theorem of Erdös and Hajnal.     

Edge-bipancyclicity of a hypercube with faulty vertices and edges

A bipartite graph G=(V,E) is said to be bipancyclic if it contains a cycle of every even length from 4 to |V|. Furthermore, a bipancyclic G is said to be edge-bipancyclic if every edge of G lies on a cycle of every even length. Let F_v (respectively, F_e) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional hypercube Q_n. In this paper, we show that every edge of Q_n-F_v-F_e lies on a cycle of every even length from 4 to 2ⁿ-2|F_v| even if |F_v|+|F_e|?n-2, where n?3. Since Q_n is bipartite of equal-size partite sets and is regular of vertex-degree n, both the number of faults tolerated and the length of a longest fault-free cycle obtained are worst-case optimal.     

Main Q-eigenvalues and generalized Q-cospectrality of graphs

Let Q ^G denote the signless Laplacian matrix of a graph G. An eigenvalue μ of Q ^G is said to be a main Q-eigenvalue of G if μ has an eigenvector which is not orthogonal to an all-ones vector e. We give some basic properties of main Q-eigenvalues. For a graph G of order n, G is called Q-controllable if G has n distinct main Q-eigenvalues. We show that a graph H is generalized Q-cospectral with a Q-controllable G if and only if H is Q-controllable and there exists a unique rational orthogonal matrix R such that R _e = e, Q _H = R ^? Q _G R.     

Vertex Turán problems in the hypercube

Let Qn be the n-dimensional hypercube: the graph with vertex set n{0,1} and edges between vertices that differ in exactly one coordinate. For 1?d?n and F⊆d{0,1} we say that S⊆n{0,1} is F-free if every embedding satisfies i(F)?S. We consider the question of how large S⊆n{0,1} can be if it is F-free. In particular we generalise the main prior result in this area, for F=²{0,1}, due to E.A. Kostochka and prove a local stability result for the structure of near-extremal sets.We also show that the density required to guarantee an embedded copy of at least one of a family of forbidden configurations may be significantly lower than that required to ensure an embedded copy of any individual member of the family.Finally we show that any subset of the n-dimensional hypercube of positive density will contain exponentially many points from some embedded d-dimensional subcube if n is sufficiently large.     

Vertex Partitions of Hypercubes into Symmetric Snakes

In his paper (Combinatorica 14 (4) (1994), 491-496) Wojciechowski constructed a snake S, i.e. an induces cycle, in the n-dimensional hypercube Q_n such that for some subgroup G of the automorphism group of Q_n, of order at most 16, the G-translates of S partition the vertex set of Q_n. In this note, we use this snake to obtain a similar result for a symmetric snake with order of G at most 32.     

Finding large cycles in Hamiltonian graphs

We show how to find in Hamiltonian graphs a cycle of length n^{Ω(1/loglogn)}=exp(Ω(logn/loglogn)). This is a consequence of a more general result in which we show that if G has a maximum degree d and has a cycle with k vertices (or a 3-cyclable minor H with k vertices), then we can find in O(n³) time a cycle in G of length k^Ω(1/logd). From this we infer that if G has a cycle of length k, then one can find in O(n³) time a cycle of length k^{Ω(1/(log(n/k)+loglogn))}, which implies the result for Hamiltonian graphs. Our results improve, for some values of k and d, a recent result of Gabow (2004) [11] showing that if G has a cycle of length k, then one can find in polynomial time a cycle in G of length . We finally show that if G has fixed Euler genus g and has a cycle with k vertices (or a 3-cyclable minor H with k vertices), then we can find in polynomial time a cycle in G of length f(g)k^Ω(1), running in time O(n²) for planar graphs.     

On the Hadwiger's conjecture for graph products

The Hadwiger number η(G) of a graph G is the largest integer h such that the complete graph on h nodes K_h is a minor of G. Equivalently, η(G) is the largest integer such that any graph on at most η(G) nodes is a minor of G. The Hadwiger's conjecture states that for any graph G, η(G)?χ(G), where χ(G) is the chromatic number of G. It is well-known that for any connected undirected graph G, there exists a unique prime factorization with respect to Cartesian graph products. If the unique prime factorization of G is given as G₁□G₂□?□G_k, where each G_i is prime, then we say that the product dimension of G is k. Such a factorization can be computed efficiently.In this paper, we study the Hadwiger's conjecture for graphs in terms of their prime factorization. We show that the Hadwiger's conjecture is true for a graph G if the product dimension of G is at least . In fact, it is enough for G to have a connected graph M as a minor whose product dimension is at least , for G to satisfy the Hadwiger's conjecture. We show also that if a graph G is isomorphic to F^d for some F, then η(G)?χ(G)^{⌊(d-1)/2⌋}, and thus G satisfies the Hadwiger's conjecture when d?3. For sufficiently large d, our lower bound is exponentially higher than what is implied by the Hadwiger's conjecture.Our approach also yields (almost) sharp lower bounds for the Hadwiger number of well-known graph products like d-dimensional hypercubes, Hamming graphs and the d-dimensional grids. In particular, we show that for the d-dimensional hypercube H_d, . We also derive similar bounds for G^d for almost all G with n nodes and at least edges.     

Leafy spanning trees in hypercubes

We prove that the d-dimensional hypercube, Q_d, with n = 2^d vertices, contains a spanning tree with at least

leaves. This improves upon the bound implied by a more general result on spanning trees in graphs with minimum degree δ, which gives (1 − O(log log n)/log₂n)n as a lower bound on the maximum number of leaves in spanning trees of n-vertex hypercubes.     

PATHS AND CYCLES EMBEDDING ON FAULTY ENHANCED HYPERCUBE NETWORKS

Let Qn,k(n≥3,1≤k≤n-1) be an n-dimensional enhanced hypercube which is an attractive variant of the hypercube and can be obtained by adding some complementary edges,fv and fe be the numbers of faulty vertices and faulty edges,respectively.In this paper,we give three main results.First,a fault-free path P [u,v] of length at least 2n-2fv-1(respectively,2n-2fv-2) can be embedded on Qn,k with fv+fe≤n-1 when d Qn,k(u,v) is odd(respectively,d Qn,k(u,v) is even).Secondly,an Qn,k is(n-2) edgefault-free hyper Hamiltonian-laceable when n(≥3) and k have the same parity.Lastly,a fault-free cycle of length at least 2n-2fv can be embedded on Qn,k with fe≤n-1 and fv+fe≤2n-4.     

Path bundles on n-cubes

A path bundle is a set of 2^a paths in an n-cube, denoted Q_n, such that every path has the same length, the paths partition the vertices of Q_n, the endpoints of the paths induce two subcubes of Q_n, and the endpoints of each path are complements. This paper shows that a path bundle exists if and only if n>0 is odd and 0?a?n-⌈log₂(n+1)⌉.     

Complete Multipartite Graphs and the Relaxed Coloring Game

Let k be a positive integer, d be a nonnegative integer, and G be a finite graph. Two players, Alice and Bob, play a game on G by coloring the uncolored vertices with colors from a set X of k colors. At all times, the subgraph induced by a color class must have maximum degree at most d. Alice wins the game if all vertices are eventually colored; otherwise, Bob wins. The least k such that Alice has a winning strategy is called the d-relaxed game chromatic number of G, denoted ?? _g ^d (G). It is known that there exist graphs such that ?? _g ⁰(G)?=?3, but ?? _g ¹(G)?>?3. We will show that for all positive integers m, there exists a complete multipartite graph G such that m?????? _g ⁰(G)?<??? _g ¹(G).     

Matchings in 3-vertex-critical graphs: The odd case

A subset of vertices D of a graph G is a dominating set for G if every vertex of G not in D is adjacent to one in D. The cardinality of any smallest dominating set in G is denoted by γ(G) and called the domination number of G. Graph G is said to be γ-vertex-critical if γ(G-v)<γ(G), for every vertex v in G. A graph G is said to be factor-critical if G-v has a perfect matching for every choice of v∈V(G).In this paper, we present two main results about 3-vertex-critical graphs of odd order. First we show that any such graph with positive minimum degree and at least 11 vertices which has no induced subgraph isomorphic to the bipartite graph K_1,5 must contain a near-perfect matching. Secondly, we show that any such graph with minimum degree at least three which has no induced subgraph isomorphic to the bipartite graph K_1,4 must be factor-critical. We then show that these results are best possible in several senses and close with a conjecture.     

On the immersion of digraphs in cubes

We consider some problems concerning generalizations of embeddings of acyclic digraphs inton-dimensional dicubes. In particular, we define an injectioni from a digraphD into then-dimensional dicubeQ _n to be animmersion if for any two elementsa andb inD there is a directed path inD froma tob iff there is a directed path inQ _n fromi(a) toi(b). We further define the immersion to bestrong iff there is a way of choosing these paths so that paths inQ _n corresponding to arcs inD have disjoint interiors, and we introduce a natural notion of “minimality” on the set of arcs of a digraph in terms of its paths. Our main theorem then becomes:Every (minimal) n-element acyclic digraph can be (strongly) immersed in Q _n. We also present examples ofn-element digraphs which cannot be immersed inQ _n?1 and examples of 9n-element non-minimal digraphs which cannot be strongly immersed inQ10n _?1. We conclude with some applications.     

A lower bound for the circumference of a graph

Let G=(V, E) be a block of order n, different from K_n. Let m=min {d(x)+d(y): [x, y]?E}. We show that if m?n then G contains a cycle of length at least m.     

The lollipop graph is determined by its Q-spectrum

A graph G is said to be determined by its Q-spectrum if with respect to the signless Laplacian matrix Q, any graph having the same spectrum as G is isomorphic to G. The lollipop graph, denoted by H_n,p, is obtained by appending a cycle C_p to a pendant vertex of a path P_n−p. In this paper, it is proved that all lollipop graphs are determined by their Q-spectra.     

On the diameter and radius of randon subgraphs of the cube

The n-dimensional cube Qⁿ is the graph whose vertices are the subsets of {1,…n}, with two vertices adjacent if and only if their symmetric difference is a singleton. Clearly Qⁿ has diameter and radious n. Write M = n2^n-1 = e(Qⁿ) for the size of Qⁿ. Let Q = (Q_t)_o^M be a random Qⁿ-process. Thus Q^t is a spanning subgraph of Qⁿ of size t, and Q_t is obtained from Q_t–1 by the random addition of an edge of Qⁿ not in Q_t–1, Let t^(k) = τ(Q;δ?k) be the hitting time of the property of having minimal degree at least k. We show that the diameter d_t = diam (Q_t) of Q_t in almost every Q? behaves as follows: d_t starts infinite and is first finite at time t⁽¹⁾, it equals n + 1 for t⁽¹⁾ ? t⁽²⁾ and d_t, = n for t ? t⁽²⁾. We also show that the radius of Q_t, is first finite for t = t⁽¹⁾, when it assumes the value n. These results are deduced from detailed theorems concerning the diameter and radius of the almost surely unique largest component of Q_t, for t = Ω(M). © 1994 John Wiley & Sons, Inc.