In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.
Typical Hall plates for practical magnetic field sensing purposes are plane, simply-connected regions with peripheral contacts. Their output voltage is the sum of even and odd functions of the applied magnetic field. ...Typical Hall plates for practical magnetic field sensing purposes are plane, simply-connected regions with peripheral contacts. Their output voltage is the sum of even and odd functions of the applied magnetic field. They are commonly called offset and Hall voltage. Contemporary smart Hall sensor circuits extract the Hall voltage via spinning current Hall probe schemes, thereby cancelling out the offset very efficiently. The magnetic field response of such Hall plates can be computed via the electric potential or via the stream function. Conversely, Hall plates with holes show new phenomena: 1) the stream function exists only for a limited class of multiply-connected domains, and 2) a sub-class of 1) behaves like a Hall/Anti-Hall bar configuration, i.e., no Hall voltage appears between any two points on the hole boundary if current contacts are on their outer boundary. The paper studies the requirements under which these effects occur. Canonical cases of simply and doubly connected domains are computed analytically. The focus is on 2D multiply-connected Hall plates where all boundaries are insulating and where all current contacts are point sized.展开更多
Letk?2 be an integer and let G be a graph of ordern with minimum degree at leastk, n?8k -16 for evenn and n?6k - 13 for oddn. If the degree sum of each pair of nonadjacent vertices of G is at least n, then for any giv...Letk?2 be an integer and let G be a graph of ordern with minimum degree at leastk, n?8k -16 for evenn and n?6k - 13 for oddn. If the degree sum of each pair of nonadjacent vertices of G is at least n, then for any given Hamiltonian cycleC. G has a [k, k + 1]-factor containingC展开更多
In this paper, a sufficient condition for a balance bipartite graph to have a connected [1, k]-factor is given, which generalizes a known condition of a balance bipartite graph for the existence of a hamilton-path.
This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connec...This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connectivity and efficiency of the CDS. Compared with Wu's algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.展开更多
基金the National Natural Science Foundation of China.
文摘In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.
文摘Typical Hall plates for practical magnetic field sensing purposes are plane, simply-connected regions with peripheral contacts. Their output voltage is the sum of even and odd functions of the applied magnetic field. They are commonly called offset and Hall voltage. Contemporary smart Hall sensor circuits extract the Hall voltage via spinning current Hall probe schemes, thereby cancelling out the offset very efficiently. The magnetic field response of such Hall plates can be computed via the electric potential or via the stream function. Conversely, Hall plates with holes show new phenomena: 1) the stream function exists only for a limited class of multiply-connected domains, and 2) a sub-class of 1) behaves like a Hall/Anti-Hall bar configuration, i.e., no Hall voltage appears between any two points on the hole boundary if current contacts are on their outer boundary. The paper studies the requirements under which these effects occur. Canonical cases of simply and doubly connected domains are computed analytically. The focus is on 2D multiply-connected Hall plates where all boundaries are insulating and where all current contacts are point sized.
文摘Letk?2 be an integer and let G be a graph of ordern with minimum degree at leastk, n?8k -16 for evenn and n?6k - 13 for oddn. If the degree sum of each pair of nonadjacent vertices of G is at least n, then for any given Hamiltonian cycleC. G has a [k, k + 1]-factor containingC
基金The work is supported by NNSF (10471078)Research Foundation of Doctoral Discipline of Higher Education(20040422004)DRF of QFNU and NSF(Y2003G01)of Shandong Province.
文摘In this paper, a sufficient condition for a balance bipartite graph to have a connected [1, k]-factor is given, which generalizes a known condition of a balance bipartite graph for the existence of a hamilton-path.
文摘This paper proposes a connected dominating set (CDS) based mobility management algorithm, CMMA, to solve the problems of node entering, exiting and movement in mobile ad hoc networks (MANETs), which ensures the connectivity and efficiency of the CDS. Compared with Wu's algorithm, the proposed algorithm can make full use of present network conditions and involves fewer nodes. Also it has better performance with regard to the approximation factor, message complexity, and time complexity.
