Hamiltonian properties and the bipartite independence number
نویسندگان
چکیده
By using the notion of compatibility of subgraphs with a perfect matching developed for digraphs in [1], we show that if, in a balanced bipartite graph G of minimum degree 6, the maximum cardinality ebip of a balanced independent subset satisfies ~bip ~< 26-4, then G is hamiltonian-biconnected, and if Ctbip ~< 26-2, G contains a hamiltonian path. Moreover, we give some properties of balanced bipartite graphs which are not hamiltonian, and which satisfy ~bip ~ 26-2.
منابع مشابه
Some Properties of the Nil-Graphs of Ideals of Commutative Rings
Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal such that and two distinct vertices and are adjacent if and only if . Here, we study conditions under which is complete or bipartite. Also, the independence number of is deter...
متن کاملA balanced independence number condition for a balanced bipartite graph to be Hamiltonian
Let G be a 2-connected balanced bipartite graph with partite sets X1 and X2. We denote α∗ BIP (G) be the maximum cardinality of an independent set A1∪A2 of G such that A1 ⊂ X1, A2 ⊂ X2 and ∣∣|A1| − |A2|∣∣ ≤ 1. In this paper, we prove that if α∗ BIP (G) ≤ 2δ(G)− 2, then G is Hamiltonian. This condition is best possible, and this implies several known results, for example, in [1, 6, 7, 11]. Also ...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملOn some covering graphs of a graph
For a graph G with vertex set V (G) = {v1, v2, . . . , vn}, let S be the covering set of G having the maximum degree over all the minimum covering sets of G. Let NS[v] = {u ∈ S : uv ∈ E(G)} ∪ {v} be the closed neighbourhood of the vertex v with respect to S. We define a square matrix AS(G) = (aij), by aij = 1, if |NS[vi] ∩NS[vj]| ≥ 1, i 6= j and 0, otherwise. The graph G associated with the mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 161 شماره
صفحات -
تاریخ انتشار 1996