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ę "pendant" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
k-Perfect geodominating sets in graphs
Autorzy:
Mojdeh, D. A.
Rad, N. J.
Powiązania:
https://bibliotekanauki.pl/articles/255558.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
geodominating set
perfect geodomination number
pendant vertex
pendant edge
Opis:
A perfect geodominating set in a graph G is a geodominating set S such that any vertex v ∈ V(G)\S is geodominated by exactly one pair of vertices of S. A k-perfect geodominating set is a geodominating set S such that any vertex v ∈ V(G)\S is geodominated by exactly one pair x, y of vertices of S with d(x, y) = k. We study perfect and k-perfect geodomination numbers of a graph G.
Źródło:
Opuscula Mathematica; 2007, 27, 1; 51-57
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hypergraphs with Pendant Paths are not Chromatically Unique
Autorzy:
Tomescu, Ioan
Powiązania:
https://bibliotekanauki.pl/articles/30147214.pdf
Data publikacji:
2014-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
sunflower hypergraph
chromatic polynomial
pendant path
chromatic uniqueness
Opis:
In this note it is shown that every hypergraph containing a pendant path of length at least 2 is not chromatically unique. The same conclusion holds for h-uniform r-quasi linear 3-cycle if r ≥ 2.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 1; 23-29
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Two Generalized Connectivities of Graphs
Autorzy:
Sun, Yuefang
Li, Fengwei
Jin, Zemin
Powiązania:
https://bibliotekanauki.pl/articles/31342427.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
k -connectivity
pendant tree-connectivity
Cartesian product
Cayley graph
Opis:
The concept of generalized $k$-connectivity $ \kappa_k (G) $, mentioned by Hager in 1985, is a natural generalization of the path-version of the classical connectivity. The pendant tree-connectivity $ \tau_k (G) $ was also introduced by Hager in 1985, which is a specialization of generalized $k$-connectivity but a generalization of the classical connectivity. Another generalized connectivity of a graph $G$, named $k$-connectivity $ \kappa_k^' (G) $, introduced by Chartrand et al. in 1984, is a generalization of the cut-version of the classical connectivity. In this paper, we get the lower and upper bounds for the difference of $ \kappa_k^' (G) $ and $ \tau_k(G) $ by showing that for a connected graph $G$ of order $n$, if $ \kappa_k^' (G) \ne n − k + 1 $ where $ k \ge 3 $, then $ 1 \le \kappa_k^' (G) − \tau_k (G) \le n − k $; otherwise, $ 1 \le κ_k^' (G) − \tau_k(G) \le n − k + 1 $. Moreover, all of these bounds are sharp. We get a sharp upper bound for the 3-connectivity of the Cartesian product of any two connected graphs with orders at least 5. Especially, the exact values for some special cases are determined. Among our results, we also study the pendant tree-connectivity of Cayley graphs on Abelian groups of small degrees and obtain the exact values for $ \tau_k(G) $, where $G$ is a cubic or 4-regular Cayley graph on Abelian groups, $ 3 \le k \le n $.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 245-261
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distance irregularity strength of graphs with pendant vertices
Autorzy:
Susanto, Faisal
Wijaya, Kristiana
Slamin
Semaničová-Feňovčíková, Andrea
Powiązania:
https://bibliotekanauki.pl/articles/2216177.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
vertex k-labeling
distance irregular vertex k-labeling
distance irregularity strength
pendant vertices
Opis:
A vertex k-labeling ϕ : V (G) → {1, 2, . . . , k} on a simple graph G is said to be a distance irregular vertex k-labeling of G if the weights of all vertices of G are pairwise distinct, where the weight of a vertex is the sum of labels of all vertices adjacent to that vertex in G. The least integer k for which G has a distance irregular vertex k-labeling is called the distance irregularity strength of G and denoted by dis(G). In this paper, we introduce a new lower bound of distance irregularity strength of graphs and provide its sharpness for some graphs with pendant vertices. Moreover, some properties on distance irregularity strength for trees are also discussed in this paper.
Źródło:
Opuscula Mathematica; 2022, 42, 3; 439-458
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Coins from the site of Marina el-Alamein: an overview of recent and some earlier finds
Autorzy:
Lichocka, Barbara
Powiązania:
https://bibliotekanauki.pl/articles/1634180.pdf
Data publikacji:
2019-12-31
Wydawca:
Uniwersytet Warszawski. Wydawnictwa Uniwersytetu Warszawskiego
Tematy:
Alexandria
Egypt
Antoninus Pius
Hadrian
cast
coins
halved coin
pendant
late Roman/provincial coinage
Opis:
A recently uncovered assemblage of 13 coins, some of significant dating value, but all loose finds from fieldwork conducted by the Polish–Egyptian Conservation Mission, is discussed in the context of earlier coin finds recorded by the two Polish projects involved in the archaeological excavation and conservation of the Marina el-Alamein site on the Mediterranean coast of Egypt. The focus is foremost on predominantly Roman provincial coins originating from the Alexandrian mint. One of these bears a mark indicative of its use as a pendant. Hadrian bronzes, most numerous in this group, along with coins of Trajan and Antoninus Pius corroborate a peak in the development of the town in the 2nd century AD, while late Roman imperial specimens are direct evidence for its continued functioning in the late antique period.
Źródło:
Polish Archaeology in the Mediterranean; 2019, 28(2); 125-140
1234-5415
Pojawia się w:
Polish Archaeology in the Mediterranean
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pédagogie universitaire rénovée à l’époque de la pandémie : comment passer de l’autre côté de l’écran ?
Improving university teaching during the pandemic: how to switch to the other side of the screen?
Autorzy:
Sujecka-Zając, Jolanta
Powiązania:
https://bibliotekanauki.pl/articles/2098451.pdf
Data publikacji:
2021-12-27
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu. Collegium Novum. Polskie Towarzystwo Neofilologiczne
Tematy:
pédagogie universitaire
accompagnement pédagogique des apprenants
enseignement pédo-centré
enseignement pendant la pandémie
university teaching
monitoring student learning
learner-centered pedagogy
education in the pandemic
Opis:
The 2020/2021 pandemic year has been difficult for teachers at all levels of education including higher education. There was a need to switch quickly to another type of education that would achieve the same objectives as before. How did the university teachers face this challenge? What consequences have been drawn for university teaching in general? We propose to take a global perspective of the state of current university pedagogy to highlight the need to renovate its approaches and to put the learner at the center of the process so to provide pedagogical support in his learning. We will analyze the results of three surveys concerning remote teaching and learning in Poland and in Europe. Finally, we will show what tools can be used to better monitor students` learning in virtual classes. 
Źródło:
Neofilolog; 2021, 57/2; 249-264
1429-2173
Pojawia się w:
Neofilolog
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