Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "star" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 21
Tytuł:
Minimum Coverings of Crowns with Cycles and Stars
Autorzy:
Lin, Jenq-Jong
Jou, Min-Jen
Powiązania:
https://bibliotekanauki.pl/articles/32361751.pdf
Data publikacji:
2022-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
cycle
star
covering
decomposition
crown
Opis:
Let F, G and H be graphs. A (G, H)-decomposition of F is a partition of the edge set of F into copies of G and copies of H with at least one copy of G and at least one copy of H. For R ⊆ F, a (G, H)-covering of F with padding R is a (G, H)-decomposition of F + E(R). A (G, H)-covering of F with the smallest cardinality is a minimum (G, H)-covering. This paper gives the solution of finding the minimum (Ck, Sk)-covering of the crown Cn,n−1.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 1; 81-88
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On light subgraphs in plane graphs of minimum degree five
Autorzy:
Jendrol', Stanislav
Madaras, Tomáš
Powiązania:
https://bibliotekanauki.pl/articles/972033.pdf
Data publikacji:
1996
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
planar graph
light subgraph
star
triangulation
Opis:
A subgraph of a plane graph is light if the sum of the degrees of the vertices of the subgraph in the graph is small. It is well known that a plane graph of minimum degree five contains light edges and light triangles. In this paper we show that every plane graph of minimum degree five contains also light stars $K_{1,3}$ and $K_{1,4}$ and a light 4-path P₄. The results obtained for $K_{1,3}$ and P₄ are best possible.
Źródło:
Discussiones Mathematicae Graph Theory; 1996, 16, 2; 207-217
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
Autorzy:
Broersma, Hajo
Marchal, Bert
Paulusma, Daniel
Salman, A.
Powiązania:
https://bibliotekanauki.pl/articles/743123.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
backbone coloring
split graph
matching
star
Opis:
We continue the study on backbone colorings, a variation on classical vertex colorings that was introduced at WG2003. Given a graph G = (V,E) and a spanning subgraph H of G (the backbone of G), a λ-backbone coloring for G and H is a proper vertex coloring V→ {1,2,...} of G in which the colors assigned to adjacent vertices in H differ by at least λ. The algorithmic and combinatorial properties of backbone colorings have been studied for various types of backbones in a number of papers. The main outcome of earlier studies is that the minimum number l of colors, for which such colorings V→ {1,2,...,l} exist, in the worst case is a factor times the chromatic number (for path, tree, matching and star backbones). We show here that for split graphs and matching or star backbones, l is at most a small additive constant (depending on λ) higher than the chromatic number. Our proofs combine algorithmic and combinatorial arguments. We also indicate other graph classes for which our results imply better upper bounds on l than the previously known bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2009, 29, 1; 143-162
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Note on the Ramsey Number of Even Wheels Versus Stars
Autorzy:
Haghi, Sh.
Maimani, H.R.
Powiązania:
https://bibliotekanauki.pl/articles/31342334.pdf
Data publikacji:
2018-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Ramsey number
star
wheel
weakly pancyclic
Opis:
For two graphs $ G_1 $ and $ G_2 $, the Ramsey number $ R(G_1,G_2) $ is the smallest integer $N$, such that for any graph on $N$ vertices, either $G$ contains $ G_1 $ or $ \overline{G} $ contains $ G_2 $. Let $ S_n $ be a star of order $n$ and $ W_m $ be a wheel of order $ m + 1 $. In this paper, we will show $ R(W_n, S_n) \le 5n//2 − 1 $, where $ n \ge 6 $ is even. Also, by using this theorem, we conclude that $ R(W_n, S_n) = 5n//2 − 2 $ or $ 5n//2 −1 $, for $ n \ge 6 $ and even. Finally, we prove that for sufficiently large even n we have $ R(W_n, S_n) = 5n//2 − 2 $.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 2; 397-404
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ansambl aktorski
Actors’ ensemble
Autorzy:
HENDRYKOWSKI, MAREK
Powiązania:
https://bibliotekanauki.pl/articles/920958.pdf
Data publikacji:
2016-11-03
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
actor
actress
acting
star
star system
team
collective creation
ensamble
casting
cast direction
art of film
semiotics
Opis:
The article analyses how actors’ ensembles function as an alternative to the star system of actors’ participation in film.
Źródło:
Images. The International Journal of European Film, Performing Arts and Audiovisual Communication; 2016, 19, 28; 135-146
1731-450X
Pojawia się w:
Images. The International Journal of European Film, Performing Arts and Audiovisual Communication
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On local structure of 1-planar graphs of minimum degree 5 and girth 4
Autorzy:
Hudák, Dávid
Madaras, Tomás
Powiązania:
https://bibliotekanauki.pl/articles/744412.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
light graph
1-planar graph
star
cycle
Opis:
A graph is 1-planar if it can be embedded in the plane so that each edge is crossed by at most one other edge. We prove that each 1-planar graph of minimum degree 5 and girth 4 contains
(1) a 5-vertex adjacent to an ≤ 6-vertex,
(2) a 4-cycle whose every vertex has degree at most 9,
(3) a $K_{1,4}$ with all vertices having degree at most 11.
Źródło:
Discussiones Mathematicae Graph Theory; 2009, 29, 2; 385-400
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Super $(a, d)$-$H$-Antimagic Total Covering of Star Related Graphs
Autorzy:
Kathiresan, K.M.
Laurence, S. David
Powiązania:
https://bibliotekanauki.pl/articles/31234087.pdf
Data publikacji:
2015-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
super (a
d)-H-antimagic total labeling
star
Opis:
Let $G = (V (G), E (G))$ be a simple graph and $H$ be a subgraph of $G$. $G$ admits an $H$-covering, if every edge in $E(G)$ belongs to at least one subgraph of $G$ that is isomorphic to $H$. An $(a, d)$-$H$-antimagic total labeling of $G$ is a bijection $ \lambda : V (G) \cup E(G) \rightarrow {1, 2, 3, . . ., |V (G)| + |E(G)|}$ such that for all subgraphs $ H^' $ isomorphic to $H$, the $H^′$ weights $ wt(H^') = \sum_{v \in V (H^') } \lambda (v) + \sum_{e \in E(H^')} \lambda (e) $ constitute an arithmetic progression $a$, $a+d$, $a+2d$, . . ., $a+(n−1)d$ where $a$ and $d$ are positive integers and $n$ is the number of subgraphs of $G$ isomorphic to $H$. Additionally, the labeling $ \lambda $ is called a super $(a, d)$-$H$-antimagic total labeling if $ \lambda (V (G)) = {1, 2, 3, . . ., |V (G)|} $. In this paper we study super $(a, d)-H$-antimagic total labelings of star related graphs $ G_u[S_n]$ and caterpillars.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 4; 755-764
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Autorzy:
Lee, Hung-Chih
Chen, Zhen-Chun
Powiązania:
https://bibliotekanauki.pl/articles/31521539.pdf
Data publikacji:
2020-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
decomposition
complete graph
Hamiltonian path
Hamiltonian cycle
star
Opis:
Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once. A k-star, denoted by Sk, is a star with k edges. In this paper, we give necessary and sufficient conditions for decomposing the complete graph into α copies of Hamiltonian path (cycle) and β copies of S3.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 823-839
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Restricted Size Ramsey Number Involving a Path P3
Autorzy:
Silaban, Denny Riama
Baskoro, Edy Tri
Uttunggadewa, Saladin
Powiązania:
https://bibliotekanauki.pl/articles/31343288.pdf
Data publikacji:
2019-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
restricted size Ramsey number
path
connected graph
star
Opis:
For any pair of graphs $G$ and $H$, both the size Ramsey number $ \hat{r}(G,H) $ and the restricted size Ramsey number $ r^\ast (G,H) $ are bounded above by the size of the complete graph with order equals to the Ramsey number $ r(G,H) $, and bounded below by $ e(G) + e(H) − 1 $. Moreover, trivially,$ \hat{r} (G,H) \le r^\ast (G,H) $. When introducing the size Ramsey number for graph, Erdős et al. (1978) asked two questions; (1) Do there exist graphs $G$ and $H$ such that $ \hat{r} (G,H) $ attains the upper bound? and (2) Do there exist graphs $G$ and $H$ such that $ \hat{r} (G,H) $ is significantly less than the upper bound? In this paper we consider the restricted size Ramsey number $ r^\ast (G,H) $. We answer both questions above for $ r^\ast (G,H) $ when $ G = P_3 $ and $H$ is a connected graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 3; 757-769
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Od Połtawy do Odessy. Wiera Chołodnaja – fenomen gwiazdy kina niemego
Autorzy:
Roguska, Julia
Powiązania:
https://bibliotekanauki.pl/articles/1789988.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Warszawski. Wydawnictwa Uniwersytetu Warszawskiego
Tematy:
Ukrainian actress
star
silent fi lm
phenomenon
popularity
melodrama
Opis:
This article introduces the profi le of Vera Kholodnaya – a silent fi lm actress. The work of the artist, once regarded as one of the biggest stars of the Russian cinema, today is somewhat forgotten. One of the causes of Kholodnaya’s achievements is the fact that most of the fi lms with her participation have not survived to our times. After Bolsheviks came to power, the legacy of the actress, like that of many other fi lmmakers of the pre-revolutionary era, sank to oblivion. The article is an attempt to outline the most important stages of Kholodnaya’s life and artistic activity. The author focuses on the Ukrainian context of the actress’s life, which is usually ignored by researchers in their analysis. Most of them consider Kholodnaya solely a Russian actress (due to the fact that she was featured primarily in the Russian fi lm production). Her adherence to the Ukrainian culture is not only proved by her origin. The evidence of her emotional attachment to Ukraine is also proved by the fact that the last year of her life she spent in Kiev, Kharkov and Odessa performing in the theatre and cinema. The article analyses the causes of Kholodnaya’s popularity phenomenon who is often compared to today’s famous fi lm stars. This paper is an attempt to show the actress not only as «the queen of the screen» (as she was perceived by her contemporaries), but also as a remarkable woman, the inspiration for directors, actors and multitude of her admirers, for whom she was a role model.
Źródło:
Studia Ucrainica Varsoviensia; 2017, 5; 253-261
2299-7237
Pojawia się w:
Studia Ucrainica Varsoviensia
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
Autorzy:
Klešč, Marián
Schrötter, Štefan
Powiązania:
https://bibliotekanauki.pl/articles/30146429.pdf
Data publikacji:
2013-07-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph
drawing
crossing number
Cartesian product
join product
star
Opis:
The crossing number $ \text{cr}(G) $ of a graph $ G $ is the minimal number of crossings over all drawings of $ G $ in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of crossing numbers were obtained. The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. Moreover, except of six graphs, the crossing numbers of Cartesian products $ G \square K_{1,n} $ for all other connected graphs $ G $ on five vertices are known. In this paper we are dealing with the Cartesian products of stars with graphs on six vertices. We give the exact values of crossing numbers for some of these graphs and we summarise all known results concerning crossing numbers of these graphs. Moreover, we give the crossing number of $ G_1 \square T $ for the special graph $ G_1 $ on six vertices and for any tree $ T $ with no vertex of degree two as well as the crossing number of $ K_{1,n} \square T $ for any tree $ T $ with maximum degree five.
Źródło:
Discussiones Mathematicae Graph Theory; 2013, 33, 3; 583-597
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decompositions of Complete Bipartite Graphs and Complete Graphs Into Paths, Stars, and Cycles with Four Edges Each
Autorzy:
Shyu, Tay-Woei
Powiązania:
https://bibliotekanauki.pl/articles/32083883.pdf
Data publikacji:
2021-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
complete graph
complete bipartite graph
path
star
cycle
decomposition
Opis:
Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition of G into p paths, q stars, and r cycles, each of which has 4 edges.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 451-468
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wiener index of generalized stars and their quadratic line graphs
Autorzy:
Dobrynin, Andrey
Mel'nikov, Leonid
Powiązania:
https://bibliotekanauki.pl/articles/743914.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
distance in a graph
Wiener index
star
iterated line graph
Opis:
The Wiener index, W, is the sum of distances between all pairs of vertices in a graph G. The quadratic line graph is defined as L(L(G)), where L(G) is the line graph of G. A generalized star S is a tree consisting of Δ ≥ 3 paths with the unique common endvertex. A relation between the Wiener index of S and of its quadratic graph is presented. It is shown that generalized stars having the property W(S) = W(L(L(S)) exist only for 4 ≤ Δ ≤ 6. Infinite families of generalized stars with this property are constructed.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 1; 161-175
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Aktor czy zwykły człowiek? Bohater telewizyjnych reality shows
An actor or an ordinary man? A hero of realiy shows
Autorzy:
Sosnowska, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/1181195.pdf
Data publikacji:
2016
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II
Tematy:
talent show
telewizja
człowiek
celebryta
gwiazda
rozrywka
television
man
star
entertainment
Opis:
Artykuł jest analizą obrazu zwykłego człowieka w rozrywce telewizyjnej. Telewizyjny obraz zwykłego człowiek jest współcześnie szczególnie interesujący w reality show. Programy reality show pokazują szeroki obraz różnych grup społecznych. Nie są to jednak zwykli ludzie. Reality show bazują bowiem na wyjątkowości swoich uczestników: muszą mieć talent, skazę, brak umiejętności lub wykazywać się czymś szczególnym. Dzięki temu każdy zwykły człowiek może stać się gwiazdą telewizji. Artykuł pokazuje mechanizmy tworzenia niezwykłych historii zwykłego człowieka w reality show.
The article is an image analysis of ordinary people in television entertainment. Television image ordinary the man is in our times particularly interesting in reality show. Programs reality show are showing the wide image of all sorts social groups: of the wife, the mother or teenagers. It turns out that however it isn't image of the ordinary man. Everyone must be exceptional: mother - lonely, wife - obese, and teenager - talented. In our times everyone can become a television star through reality show.
Źródło:
Zeszyty Naukowe KUL; 2016, 59, 3; 45-58
0044-4405
2543-9715
Pojawia się w:
Zeszyty Naukowe KUL
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Light classes of generalized stars in polyhedral maps on surfaces
Autorzy:
Jendrol', Stanislav
Voss, Heinz-Jürgen
Powiązania:
https://bibliotekanauki.pl/articles/744433.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
polyhedral maps
embeddings
light subgraphs
path
star
2-dimensional manifolds
surface
Opis:
A generalized s-star, s ≥ 1, is a tree with a root Z of degree s; all other vertices have degree ≤ 2. $S_i$ denotes a generalized 3-star, all three maximal paths starting in Z have exactly i+1 vertices (including Z). Let be a surface of Euler characteristic χ() ≤ 0, and m():= ⎣(5 + √{49-24χ( )})/2⎦. We prove:
(1) Let k ≥ 1, d ≥ m() be integers. Each polyhedral map G on with a k-path (on k vertices) contains a k-path of maximum degree ≤ d in G or a generalized s-star T, s ≤ m(), on d + 2- m() vertices with root Z, where Z has degree ≤ k·m() and the maximum degree of T∖{Z} is ≤ d in G. Similar results are obtained for the plane and for large polyhedral maps on ..
(2) Let k and i be integers with k ≥ 3, 1 ≤ i ≤ [k/2]. If a polyhedral map G on with a large enough number of vertices contains a k-path then G contains a k-path or a 3-star $S_i$ of maximum degree ≤ 4(k+i) in G. This bound is tight. Similar results hold for plane graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 1; 85-107
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 21

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