Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "dimension" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
Dimension of the intersection of certain Cantor sets in the plane
Autorzy:
Pedersen, Steen
Staw, Vincent T.
Powiązania:
https://bibliotekanauki.pl/articles/1397337.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Cantor set
fractal
self-similar
translation
intersection
dimension
Minkowski dimension
Opis:
In this paper we consider a retained digits Cantor set $T$ based on digit expansions with Gaussian integer base. Let $F$ be the set all $x$ such that the intersection of $T$ with its translate by $x$ is non-empty and let $F_β$ be the subset of $F$ consisting of all $x$ such that the dimension of the intersection of $T$ with its translate by $x$ is $β$ times the dimension of $T$. We find conditions on the retained digits sets under which $F_β$ is dense in $F$ for all $0 ≤ β ≤ 1$. The main novelty in this paper is that multiplication the Gaussian integer base corresponds to an irrational (in fact transcendental) rotation in the complex plane.
Źródło:
Opuscula Mathematica; 2021, 41, 2; 227-244
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
All metric bases and fault-tolerant metric dimension for square of grid
Autorzy:
Saha, Laxman
Basak, Mithun
Tiwary, Kalishankar
Powiązania:
https://bibliotekanauki.pl/articles/2048644.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
code
resolving set
metric dimension
fault-tolerant resolving set
fault-tolerant metric dimension
Opis:
For a simple connected graph G = (V,E) and an ordered subset W = {w1, w2, . . . , wk} of V , the code of a vertex v ∈ V , denoted by code(v), with respect to W is a k-tuple (d(v, w1), . . . , d(v, wk)), where d(v, wt) represents the distance between v and wt. The set W is called a resolving set of G if code(u) ≠ code(v) for every pair of distinct vertices u and v. A metric basis of G is a resolving set with the minimum cardinality. The metric dimension of G is the cardinality of a metric basis and is denoted by β(G). A set F ⊂ V is called fault-tolerant resolving set of G if F \ {v} is a resolving set of G for every v ∈ F. The fault-tolerant metric dimension of G is the cardinality of a minimal fault-tolerant resolving set. In this article, a complete characterization of metric bases for G2 mn has been given. In addition, we prove that the fault-tolerant metric dimension of G2 mn is 4 if m + n is even. We also show that the fault-tolerant metric dimension of G2 mn is at least 5 and at most 6 when m + n is odd.
Źródło:
Opuscula Mathematica; 2022, 42, 1; 93-111
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The metric dimension of circulant graphs and their Cartesian products
Autorzy:
Chau, K.
Gosselin, S.
Powiązania:
https://bibliotekanauki.pl/articles/255804.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
metric dimension
circulant graph
Cartesian product
Opis:
Let G = (V, E) be a connected graph (or hypergraph) and let d(x,y) denote the distance between vertices x,y ∈V(G). A subset W ⊆V(G) is called a resolving set for G if for every pair ol distinct vertices x, y ∈ (G), there is w ∈W such that d(x,w) ≠d(y,w). The minimum cardinality of a resolving set for G is called the metric dimension of G, denoted by β (G). The circulant graph Cn(l, 2,... , t) has vertex set {v0, v1 …, vn-1} and edges [formula] where 0 ≤ i ≤ n — 1 and 1 ≤j ≤ t and the indices are taken modulo [formula]. In this paper we determine the exact metric dimension olthe circulant graphs Cn(l, 2,... , t). extending previous results due to Borchert and Gosselin (2013), Grigorious et al. (2014), and Vetrik (2016). In particular, we show that [formula] for large enough n, which implies that the metric dimension ol these circulants is completely determined by the congruence class ol n modulo 2t. We determine the exact value of β Cn (l, 2,.. . , i)) for n ≡ 2 mod 2t and n =≡ (t + 1) mod 2t and we give better bounds on the metric dimension ol these circulants for n ≡ 0 mod 2t and n ≡ 1 mod 2t. In addition, we bound the metric dimension ol Cartesian products ol circulant graphs.
Źródło:
Opuscula Mathematica; 2017, 37, 4; 509-534
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the dimension of Archimedean solids
Autorzy:
Madaras, T.
Siroczki, P.
Powiązania:
https://bibliotekanauki.pl/articles/255658.pdf
Data publikacji:
2014
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Archimedean solid
unit-distance graph
dimension of a graph
Opis:
We study the dimension of graphs of the Archimedean solids. For most of these graphs we find the exact value of their dimension by finding unit-distance embeddings in the euclidean plane or by proving that such an embedding is not possible.
Źródło:
Opuscula Mathematica; 2014, 34, 1; 123-138
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on attractivity for the intersection of two discontinuity manifolds
Autorzy:
Difonzo, Fabio V.
Powiązania:
https://bibliotekanauki.pl/articles/1397339.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
piecewise smooth systems
sliding motion
co-dimension 2
discontinuity manifold
Opis:
In piecewise smooth dynamical systems, a co-dimension 2 discontinuity manifold can be attractive either through partial sliding or by spiraling. In this work we prove that both attractivity regimes can be analyzed by means of the moments solution, a spiraling bifurcation parameter and a novel attractivity parameter, which changes sign when attractivity switches from sliding to spiraling attractivity or vice-versa. We also study what happens at what we call attractivity transition points, showing that the spiraling bifurcation parameter is always zero at those points.
Źródło:
Opuscula Mathematica; 2020, 40, 6; 685-702
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Metric dimension of Andrasfai graphs
Autorzy:
Pejman, S. Batool
Payrovi, Shiroyeh
Behtoei, Ali
Powiązania:
https://bibliotekanauki.pl/articles/254963.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
resolving set
metric dimension
Andrasfai graph
Cayley graph
Cartesian product
Opis:
A set W ⊆ V(G) is called a resolving set, if for each pair of distinct vertices u,v ∈ V(G) there exists t ∈ W such that d(u,t) ≠ d(v,t), where d(x,y) is the distance between vertices x and y. The cardinality of a minimum resolving set for G is called the metric dimension of G and is denoted by dimM(G). This parameter has many applications in different areas. The problem of finding metric dimension is NP-complete for general graphs but it is determined for trees and some other important families of graphs. In this paper, we determine the exact value of the metric dimension of Andrasfai graphs, their complements and [formula]. Also, we provide upper and lower bounds for [formula].
Źródło:
Opuscula Mathematica; 2019, 39, 3; 415-423
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies