Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 8

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  Hamiltonian
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Improved Sufficient Conditions for Hamiltonian Properties

100%
Bode J.-P., Fricke A., Kemnitz A.
Discussiones Mathematicae Graph Theory
|
2015
|
tom 35
|
nr 2
329-334
EN
In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity condition.
2
Content available remote

On the Curvature and Heat Flow on Hamiltonian Systems

100%
Ohta S.-i.
Analysis and Geometry in Metric Spaces
|
2014
|
tom 2
|
nr 1
EN
We develop the differential geometric and geometric analytic studies of Hamiltonian systems. Key ingredients are the curvature operator, the weighted Laplacian, and the associated Riccati equation.We prove appropriate generalizations of the Bochner-Weitzenböck formula and Laplacian comparison theorem, and study the heat flow.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Chvátal-Erdös type theorems

100%
Faudree J., Faudree R., Gould R., Jacobson M., Magnant C.
Discussiones Mathematicae Graph Theory
|
2010
|
tom 30
|
nr 2
245-256
EN
The Chvátal-Erdös theorems imply that if G is a graph of order n ≥ 3 with κ(G) ≥ α(G), then G is hamiltonian, and if κ(G) > α(G), then G is hamiltonian-connected. We generalize these results by replacing the connectivity and independence number conditions with a weaker minimum degree and independence number condition in the presence of sufficient connectivity. More specifically, it is noted that if G is a graph of order n and k ≥ 2 is a positive integer such that κ(G) ≥ k, δ(G) > (n+k²-k)/(k+1), and δ(G) ≥ α(G)+k-2, then G is hamiltonian. It is shown that if G is a graph of order n and k ≥ 3 is a positive integer such that κ(G) ≥ 4k²+1, δ(G) > (n+k²-2k)/k, and δ(G) ≥ α(G)+k-2, then G is hamiltonian-connected. This result supports the conjecture that if G is a graph of order n and k ≥ 3 is a positive integer such that κ(G) ≥ k, δ(G) > (n+k²-2k)/k, and δ(G) ≥ α(G)+k-2, then G is hamiltonian-connected, and the conjecture is verified for k = 3 and 4.
4
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On the intersection graphs of ideals of direct product of rings

88%
Rad N., Jafari S., Ghosh S.
Discussiones Mathematicae - General Algebra and Applications
|
2014
|
tom 34
|
nr 2
191-201
EN
In this paper we first calculate the number of vertices and edges of the intersection graph of ideals of direct product of rings and fields. Then we study Eulerianity and Hamiltonicity in the intersection graph of ideals of direct product of commutative rings.
5
Content available remote

On k-Path Pancyclic Graphs

88%
Bi Z., Zhang P.
Discussiones Mathematicae Graph Theory
|
2015
|
tom 35
|
nr 2
271-281
EN
For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic. In this paper, we present sufficient conditions for graphs to be k-path pancyclic. For a graph G of order n ≥ 3, we establish sharp lower bounds in terms of n and k for (a) the minimum degree of G, (b) the minimum degree-sum of nonadjacent vertices of G and (c) the size of G such that G is k-path pancyclic
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

A Hamiltonian approach to fault isolation in a planar vertical take-off and landing aircraft model

88%
Rodriguez-Alfaro L., Alcorta-Garcia E., Lara D., Romero G.
International Journal of Applied Mathematics and Computer Science
|
2015
|
tom 25
|
nr 1
65-76
EN
The problem of fault detection and isolation in a class of nonlinear systems having a Hamiltonian representation is considered. In particular, a model of a planar vertical take-off and landing aircraft with sensor and actuator faults is studied. A Hamiltonian representation is derived from an Euler-Lagrange representation of the system model considered. In this form, nonlinear decoupling is applied in order to obtain subsystems with (as much as possible) specific fault sensitivity properties. The resulting decoupled subsystem is represented as a Hamiltonian system and observer-based residual generators are designed. The results are presented through simulations to show the effectiveness of the proposed approach.
7
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Torus-connected cycles: A simple and scalable topology for interconnection networks

88%
Bossard A., Kaneko K.
International Journal of Applied Mathematics and Computer Science
|
2015
|
tom 25
|
nr 4
723-735
EN
Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual properties aimed for by such topologies. However, this is not sufficient to lead to actual hardware implementations. Network scalability and topology simplicity are two critical parameters, and they are two of the reasons why modern supercomputers are often based on torus interconnection networks (e.g., Fujitsu K, IBM Sequoia). In this paper we first describe a new topology, torus-connected cycles (TCCs), realizing a combination of a torus and a ring, thus retaining interesting properties of torus networks in addition to those of hierarchical interconnection networks (HINs). Then, we formally establish the diameter of a TCC, and deduce a point-to-point routing algorithm. Next, we propose routing algorithms solving the Hamiltonian cycle problem, and, in a two dimensional TCC, the Hamiltonian path one. Correctness and complexities are formally proved. The proposed algorithms are time-optimal.
8
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Intersection graph of gamma sets in the total graph

75%
Chelvam T., Asir T.
Discussiones Mathematicae Graph Theory
|
2012
|
tom 32
|
nr 2
341-356
EN
In this paper, we consider the intersection graph $I_{Γ}(ℤₙ)$ of gamma sets in the total graph on ℤₙ. We characterize the values of n for which $I_{Γ}(ℤₙ)$ is complete, bipartite, cycle, chordal and planar. Further, we prove that $I_{Γ}(ℤₙ)$ is an Eulerian, Hamiltonian and as well as a pancyclic graph. Also we obtain the value of the independent number, the clique number, the chromatic number, the connectivity and some domination parameters of $I_{Γ}(ℤₙ)$.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.