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: 4

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

Wyniki wyszukiwania

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

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

Knots in $S^2 x S^1$ derived from Sym(2, ℝ)

100%
Lee S. Y., Lim Y., Park C.-Y.
Fundamenta Mathematicae
|
2000
|
tom 164
|
nr 3
241-252
EN
We realize closed geodesics on the real conformal compactification of the space V = Sym(2, ℝ) of all 2 × 2 real symmetric matrices as knots or 2-component links in $S^2 × S^1$ and show that these knots or links have certain types of symmetry of period 2.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Distance defined by spanning trees in graphs

88%
Chartrand G., Nebeský L., Zhang P.
Discussiones Mathematicae Graph Theory
|
2007
|
tom 27
|
nr 3
485-506
EN
For a spanning tree T in a nontrivial connected graph G and for vertices u and v in G, there exists a unique u-v path u = u₀, u₁, u₂,..., uₖ = v in T. A u-v T-path in G is a u- v path u = v₀, v₁,...,vₗ = v in G that is a subsequence of the sequence u = u₀, u₁, u₂,..., uₖ = v. A u-v T-path of minimum length is a u-v T-geodesic in G. The T-distance $d_{G|T}(u,v)$ from u to v in G is the length of a u-v T-geodesic. Let geo(G) and geo(G|T) be the set of geodesics and the set of T-geodesics respectively in G. Necessary and sufficient conditions are established for (1) geo(G) = geo(G|T) and (2) geo(G|T) = geo(G|T*), where T and T* are two spanning trees of G. It is shown for a connected graph G that geo(G|T) = geo(G) for every spanning tree T of G if and only if G is a block graph. For a spanning tree T of a connected graph G, it is also shown that geo(G|T) satisfies seven of the eight axioms of the characterization of geo(G). Furthermore, we study the relationship between the distance d and T-distance $d_{G|T}$ in graphs and present several realization results on parameters and subgraphs defined by these two distances.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

The periphery graph of a median graph

88%
Brešar B., Changat M., Subhamathi A., Tepeh A.
Discussiones Mathematicae Graph Theory
|
2010
|
tom 30
|
nr 1
17-32
EN
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are path-like median graphs with arbitrarily large geodetic number. Peripheral expansion with respect to periphery graph is also considered, and connections with the concept of crossing graph are established.
4
Content available remote

Distinguished geodesics and jacobi fields on first order jet spaces

51%
Balan V., Voicu N.
Open Mathematics
|
2004
|
tom 2
|
nr 4
516-526
EN
In the framework of jet spaces endowed with a non-linear connection, the special curves of these spaces (h-paths, v-paths, stationary curves and geodesics) which extend the corresponding notions from Riemannian geometry are characterized. The main geometric objects and the paths are described and, in the case when the vertical metric is independent of fiber coordinates, the first two variations of energy and the extended Jacobi field equations are derived.
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ć.