A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper,it is proved that every 2-connected k-regular claw-free graph on at most 5k(k≥10)vertices ...A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper,it is proved that every 2-connected k-regular claw-free graph on at most 5k(k≥10)vertices is Hamiltonian. Moreover, the bound 5k is best possible. A counterexample of a 2-connected k-regular claw-free non-Hamiltonian graph on 5k+1 vertices is given, and it is conjectured that every 3-connected k-regular claw-free graph on at most 12k-7 vertices is Hamiltonian.展开更多
For a path algebra A = kQ with Q an arbitrary quiver, consider the Hochschild homology groups Hn(A) and the homology groups TornAe(A, A), where Ae is the enveloping algebra of A. In this paper the groups are explicitl...For a path algebra A = kQ with Q an arbitrary quiver, consider the Hochschild homology groups Hn(A) and the homology groups TornAe(A, A), where Ae is the enveloping algebra of A. In this paper the groups are explicitly given.展开更多
Let S be a Riemann surface of analytically finite type （p, n） with 3p-3＋n 〉 0. Let a ∈ S and S = S - {a}. In this article, the author studies those pseudo-Anosov maps on S that are isotopic to the identity on S a...Let S be a Riemann surface of analytically finite type （p, n） with 3p-3＋n 〉 0. Let a ∈ S and S = S - {a}. In this article, the author studies those pseudo-Anosov maps on S that are isotopic to the identity on S and can be represented by products of Dehn twists. It is also proved that for any pseudo-Anosov map f of S isotopic to the identity on S, there are infinitely many pseudo-Anosov maps F on S - {b} = S - {a, b}, where b is a point on S, such that F is isotopic to f on S as b is filled in.展开更多
We consider even factors with a bounded number of components in the n-times iterated line graphs L^n(G). We present a characterization of a simple graph G such that L^n(G) has an even factor with at most k components,...We consider even factors with a bounded number of components in the n-times iterated line graphs L^n(G). We present a characterization of a simple graph G such that L^n(G) has an even factor with at most k components, based on the existence of a certain type of subgraphs in G. Moreover, we use this result to give some upper bounds for the minimum number of components of even factors in L^n(G) and also show that the minimum number of components of even factors in L^n(G) is stable under the closure operation on a claw-free graph G, which extends some known results. Our results show that it seems to be NP-hard to determine the minimum number of components of even factors of iterated line graphs. We also propose some problems for further research.展开更多
文摘A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper,it is proved that every 2-connected k-regular claw-free graph on at most 5k(k≥10)vertices is Hamiltonian. Moreover, the bound 5k is best possible. A counterexample of a 2-connected k-regular claw-free non-Hamiltonian graph on 5k+1 vertices is given, and it is conjectured that every 3-connected k-regular claw-free graph on at most 12k-7 vertices is Hamiltonian.
文摘For a path algebra A = kQ with Q an arbitrary quiver, consider the Hochschild homology groups Hn(A) and the homology groups TornAe(A, A), where Ae is the enveloping algebra of A. In this paper the groups are explicitly given.
文摘Let S be a Riemann surface of analytically finite type （p, n） with 3p-3＋n 〉 0. Let a ∈ S and S = S - {a}. In this article, the author studies those pseudo-Anosov maps on S that are isotopic to the identity on S and can be represented by products of Dehn twists. It is also proved that for any pseudo-Anosov map f of S isotopic to the identity on S, there are infinitely many pseudo-Anosov maps F on S - {b} = S - {a, b}, where b is a point on S, such that F is isotopic to f on S as b is filled in.
基金supported by National Natural Science Foundation of China (Grant Nos. 11471037 and 11171129)Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20131101110048)
文摘We consider even factors with a bounded number of components in the n-times iterated line graphs L^n(G). We present a characterization of a simple graph G such that L^n(G) has an even factor with at most k components, based on the existence of a certain type of subgraphs in G. Moreover, we use this result to give some upper bounds for the minimum number of components of even factors in L^n(G) and also show that the minimum number of components of even factors in L^n(G) is stable under the closure operation on a claw-free graph G, which extends some known results. Our results show that it seems to be NP-hard to determine the minimum number of components of even factors of iterated line graphs. We also propose some problems for further research.
