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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    System of preparing the personnel for railway of Uzbekistan
    System edukacji kadr dla transportu kolejowego Uzbekistanu
    Система подготовки кадров для железных дорог узбекистана
    Autorzy:
    Artikbaev, A.
    Rasulov, M.
    Mirakhmedov, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/374047.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    average education
    higher education
    Bologna Process
    national particularity
    competency
    mobility
    doctor degree
    post-university education
    wykształcenie średnie
    szkolnictwo wyższe
    Proces Boloński
    specyfika narodowa
    kompetencja
    mobilność
    stopień doktora
    kształcenie podyplomowe
    Opis:
    The paper, by the example of training for the railway industry in Uzbekistan, focuses on the experiences and characteristics of Uzbekistan's integration into the international system of education, a framework of qualifications of the European Commission. Tashkent Institute of Railway Engineering has: rated the students' knowledge of the possibility of mutual recognition and accreditation based on the comparability of disciplines and curricula; included in its institutional strategy doctoral program, which has national features aimed at providing career opportunities for young researchers and university teachers based on the fundamental nature and the humanization of education, providing the preparation of the highly qualified specialists, ensures the interconnection and interdependence at all levels of technical education: secondary, undergraduate, graduate, doctoral and post-graduate training and re-training to maintain the knowledge and skills of teachers at the level of requests engineering and production of the XXI century.
    Статья, на примере подготовки кадров для железнодорожной отрасли в Узбекистане, посвящена опыту и характеристикам интеграции Узбекистана в международную систему образования, в структуру квалификаций Европейской комиссии. Ташкентский институт инженеров железнодорожного транспорта проводит: оценку знаний студентов для возможности взаимного признания и аккредитации на основе сопоставимости дисциплин и учебных программ; в его институциональную стратегию включена докторская программа, которая имеет национальные особенности, направленные на обеспечение возможности карьерного роста для молодых исследователей и преподавателей ВУЗов на основе фундаментального характера и гуманизации образования, обеспечивающая подготовку высококвалифицированных специалистов, обеспечивающая взаимосвязь и взаимозависимость всех уровней технического образования: среднего, студентов, аспирантов, докторантов и слушателей курсов подготовки и переподготовки подготовки для поддержания знаний и навыков преподавателей на уровне запросов проектирования и производства XXI века.
    Źródło:
    Transport Problems; 2013, 8, 3; 67-73
    1896-0596
    2300-861X
    Pojawia się w:
    Transport Problems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Some totally 4-choosable multigraphs
    Autorzy:
    Woodall, Douglas
    Powiązania:
    https://bibliotekanauki.pl/articles/743409.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    maximum average degree
    planar graph
    total choosability
    list total colouring
    Opis:
    It is proved that if G is multigraph with maximum degree 3, and every submultigraph of G has average degree at most 2(1/2) and is different from one forbidden configuration C⁺₄ with average degree exactly 2(1/2), then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colours, then every element can be coloured with a colour from its own list in such a way that no two adjacent or incident elements are coloured with the same colour. This shows that the List-Total-Colouring Conjecture, that ch''(G) = χ''(G) for every multigraph G, is true for all multigraphs of this type. As a consequence, if G is a graph with maximum degree 3 and girth at least 10 that can be embedded in the plane, projective plane, torus or Klein bottle, then ch''(G) = χ''(G) = 4. Some further total choosability results are discussed for planar graphs with sufficiently large maximum degree and girth.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2007, 27, 3; 425-455
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On double domination in graphs
    Autorzy:
    Harant, Jochen
    Henning, Michael
    Powiązania:
    https://bibliotekanauki.pl/articles/744292.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    average degree
    bounds
    double domination
    probabilistic method
    Opis:
    In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V(G) is a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality of a double dominating set of G is the double domination number $γ_{×2}(G)$. A function f(p) is defined, and it is shown that $γ_{×2}(G) = min f(p)$, where the minimum is taken over the n-dimensional cube $Cⁿ = {p = (p₁,...,pₙ) | p_i ∈ IR, 0 ≤ p_i ≤ 1,i = 1,...,n}$. Using this result, it is then shown that if G has order n with minimum degree δ and average degree d, then $γ_{×2}(G) ≤ ((ln(1+d) + lnδ + 1)/δ)n$.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2005, 25, 1-2; 29-34
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Linear List Coloring of Some Sparse Graphs
    Autorzy:
    Chen, Ming
    Li, Yusheng
    Zhang, Li
    Powiązania:
    https://bibliotekanauki.pl/articles/32083756.pdf
    Data publikacji:
    2021-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    linear coloring
    maximum average degree
    planar graphs
    discharging
    Opis:
    A linear $k$-coloring of a graph is a proper $k$-coloring of the graph such that any subgraph induced by the vertices of any pair of color classes is a union of vertex-disjoint paths. A graph $G$ is linearly $L$-colorable if there is a linear coloring $c$ of $G$ for a given list assignment $L = \{L(v) : v ∈ V(G)\}$ such that $c(v) ∈ L(v)$ for all $v ∈ V(G)$, and $G$ is linearly $k$-choosable if $G$ is linearly $L$-colorable for any list assignment with $|L(v)| ≥ k$. The smallest integer $k$ such that $G$ is linearly $k$-choosable is called the linear list chromatic number, denoted by $lc_l(G)$. It is clear that \(lc_l(G)≥\Big\lceil\frac{\Delta(G)}{1}\Big\rceil+1\) for any graph $G$ with maximum degree $\Delta(G)$. The maximum average degree of a graph $G$, denoted by $mad(G)$, is the maximum of the average degrees of all subgraphs of $G$. In this note, we shall prove the following. Let $G$ be a graph, (1) if $mad(G)<\frac{8}{3}$ and $\Delta(G) ≥ 7$, then \(lc_l(G)=\Big\lceil\frac{\Delta(G)}{2}\Big\rceil+1\); (2) if $mad(G)<{18}{7}$ and $\Delta(G) ≥ 5$, then \(lc_l(G)=\Big\lceil\frac{\Delta(G)}{2}\Big\rceil+1\); (3) if $mad(G)<{20}{7}$ and $\Delta(G) ≥ 5$, then \(lc_l(G)≤\Big\lceil\frac{\Delta(G)}{2}\Big\rceil+2\).
    Źródło:
    Discussiones Mathematicae Graph Theory; 2021, 41, 1; 51-64
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Incidence Coloring—Cold Cases
    Autorzy:
    Kardoš, František
    Maceková, Mária
    Mockovčiaková, Martina
    Sopena, Éric
    Soták, Roman
    Powiązania:
    https://bibliotekanauki.pl/articles/32083735.pdf
    Data publikacji:
    2020-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    incidence coloring
    incidence chromatic number
    planar graph
    maximum average degree
    Opis:
    An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: (i) v = u, (ii) e = f, or (iii) edge vu is from the set {e, f}. An incidence coloring of G is a coloring of its incidences assigning distinct colors to adjacent incidences. The minimum number of colors needed for incidence coloring of a graph is called the incidence chromatic number. It was proved that at most Δ(G) + 5 colors are enough for an incidence coloring of any planar graph G except for Δ(G) = 6, in which case at most 12 colors are needed. It is also known that every planar graph G with girth at least 6 and Δ(G) ≥ 5 has incidence chromatic number at most Δ(G) + 2. In this paper we present some results on graphs regarding their maximum degree and maximum average degree. We improve the bound for planar graphs with Δ(G) = 6. We show that the incidence chromatic number is at most Δ(G) + 2 for any graph G with mad(G) < 3 and Δ(G) = 4, and for any graph with mad(G)<103 and Δ(G) ≥ 8.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 1; 345-354
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Equitable Coloring and Equitable Choosability of Graphs with Small Maximum Average Degree
    Autorzy:
    Dong, Aijun
    Zhang, Xin
    Powiązania:
    https://bibliotekanauki.pl/articles/31342275.pdf
    Data publikacji:
    2018-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    graph coloring
    equitable choosability
    maximum average degree
    Opis:
    A graph is said to be equitably $k$-colorable if the vertex set $V (G)$ can be partitioned into $k$ independent subsets $ V_1, V_2, . . ., V_k $ such that $ | | V_i |−| V_j | | \le 1 $ $(1 \le i, j \le k) $. A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $ \ceil{ \frac{|V(G)|}{ k } } $ vertices. In this paper, we prove that if $G$ is a graph such that $ mad(G) < 3 $, then $G$ is equitably $k$-colorable and equitably $k$- choosable where $ k \ge \text{max} \{ \Delta (G), 4 \} $. Moreover, if $G$ is a graph such that $ mad(G) < \frac{12}{5} $, then $G$ is equitably $k$-colorable and equitably $k$-choosable where $ k \ge \text{max} \{ \Delta (G), 3 \} $.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 3; 829-839
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An effect of the copper’s nanoparticles application on the degree of covering the sprayed objects
    Wpływ zastosowania nanomiedzi na stopień pokrycia opryskiwanych obiektów
    Autorzy:
    Dereń, K.
    Szewczyk, A.
    Sekutowski, T. R.
    Kowalska-Góralska, M.
    Kuta, Ł.
    Powiązania:
    https://bibliotekanauki.pl/articles/337471.pdf
    Data publikacji:
    2017
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Maszyn Rolniczych
    Tematy:
    foliar fertilizer
    water sensitive paper
    average degree of covering
    nanocopper
    spraying plants
    nozzles
    nawóz dolistny
    nanomiedź
    stopień pokrycia
    opryskiwanie roślin
    rozpylacz
    Opis:
    The main purpose of the study was to compare the average and total degree of covering the sprayed plants with the foliar fertilizer with copper and the nanocopper. The measurement of covering degree was performed in "Aporo” sprayed chamber at a constant speed of (11.16 m·s-1) and at two pressures values 0.2 and 0.28 MPa for two nozzles standard: onestream XR110-02, and a dual-stream DF120-02. Tests were conducted at a constant speed for different pressures and two conventional nozzles. The samplers in the form of water sensitive paper were used. The degree of covering was calculated using a computer image analysis method. Statistical tests were carried out based on an analysis of the average group and homogeneity of variance (ANOVA). It was found that, when the nanocopper was applied, the average degree of covering and the total degree of covering were higher than while using the foliar fertilizer (Mikrovit) with copper, regardless of the pressure and the nozzle used in tests.
    Celem badań było porównanie średniego oraz całkowitego stopnia pokrycia roślin opryskiwanych nawozem dolistnym miedzi i nanomiedzią Badania stopnia pokrycia wykonano w komorze opryskowej "Aporo". Doświadczenie przeprowadzono ze stałą prędkością opryskiwania (11.16 m·s-1), przy dwóch ciśnieniach roboczych 0.2 i 0.28 MPa dla dwóch rozpylaczy standardowych: XR 110-02 i DF 120-02. Użyto próbników w postaci papierków wodoczułych, które umieszczano na powierzchniach poziomych i pionowych sztucznych roślin. Stopień pokrycia obliczono dzięki wykorzystaniu komputerowej metody analizy obrazu. Przeprowadzono testy statystyczne oparte na analizie średnich w grupach oraz analizę jednorodności wariancji (ANOVA). Stwierdzono, że przy zastosowaniu do oprysku pierwiastka nanomiedzi średni stopień pokrycia oraz cał- kowity stopień pokrycia był wyższy niż przy zastosowaniu nawozu dolistnego Mikrovit, niezależnie od ciśnienie oraz rozpylacza wykorzystanego w badaniach.
    Źródło:
    Journal of Research and Applications in Agricultural Engineering; 2017, 62, 3; 76-79
    1642-686X
    2719-423X
    Pojawia się w:
    Journal of Research and Applications in Agricultural Engineering
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An application of graph theory to linguistic complexity
    Autorzy:
    Piperski, Alexander
    Powiązania:
    https://bibliotekanauki.pl/articles/1151871.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet im. Adama Mickiewicza w Poznaniu
    Tematy:
    linguistic complexity
    morphology
    graph theory
    average vertex degree
    Opis:
    This article introduces a new measure of linguistic complexity which is based on the dual nature of the linguistic sign. Complexity is analyzed as consisting of three components, namely the conceptual complexity (complexity of the signified), the formal complexity (complexity of the signifier) and the form-meaning correspondence complexity. I describe a way of plotting the form-meaning relationship on a graph with two tiers (the form tier and the meaning tier) and apply a complexity measure from graph theory (average vertex degree) to assess the complexity of such graphs. The proposed method is illustrated by estimating the complexity of full noun phrases (determiner + adjective + noun) in English, Swedish, and German. I also mention the limitations and the problems which might arise when using this method.
    Źródło:
    Yearbook of the Poznań Linguistic Meeting; 2014, 1, 1
    2449-7525
    Pojawia się w:
    Yearbook of the Poznań Linguistic Meeting
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An application of graph theory to linguistic complexity
    Autorzy:
    Piperski, Alexander
    Powiązania:
    https://bibliotekanauki.pl/articles/2135360.pdf
    Data publikacji:
    2014-11-19
    Wydawca:
    Uniwersytet im. Adama Mickiewicza w Poznaniu
    Tematy:
    linguistic complexity
    morphology
    graph theory
    average vertex degree
    Opis:
    This article introduces a new measure of linguistic complexity which is based on the dual nature of the linguistic sign. Complexity is analyzed as consisting of three components, namely the conceptual complexity (complexity of the signified), the formal complexity (complexity of the signifier) and the form-meaning correspondence complexity. I describe a way of plotting the form-meaning relationship on a graph with two tiers (the form tier and the meaning tier) and apply a complexity measure from graph theory (average vertex degree) to assess the complexity of such graphs. The proposed method is illustrated by estimating the complexity of full noun phrases (determiner + adjective + noun) in English, Swedish, and German. I also mention the limitations and the problems which might arise when using this method.
    Źródło:
    Yearbook of the Poznań Linguistic Meeting; 2014, 1, 1; 89-102
    2449-7525
    Pojawia się w:
    Yearbook of the Poznań Linguistic Meeting
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An advance in infinite graph models for the analysis of transportation networks
    Autorzy:
    Cera, M.
    Fedriani, E. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330503.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    infinite graph
    average degree
    extremal problems
    road transport network
    percolation threshold
    graf nieskończony
    zagadnienie ekstremum
    sieć transportowa
    próg perkolacji
    Opis:
    This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph. It also relates the new results with the corresponding situations for the finite case. In particular, concepts from ‘finite’ graph theory, like the average degree and the extremal number, are generalized and computed for some specific cases. Finally, some applications of infinite graphs to the transportation of dangerous goods are presented; they involve the analysis of networks and percolation thresholds.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 855-869
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
    Autorzy:
    Fiedorowicz, Anna
    Powiązania:
    https://bibliotekanauki.pl/articles/30146851.pdf
    Data publikacji:
    2013-03-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    acyclic colouring
    bounded degree graph
    maximum average degree
    Opis:
    A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . ., k} of colours such that adjacent vertices receive distinct colours. Such a k-colouring is called acyclic, if for every two distinct colours i and j, the subgraph induced by all the edges linking a vertex coloured with i and a vertex coloured with j is acyclic. In other words, every cycle in G has at least three distinct colours. Acyclic colourings were introduced by Gr¨unbaum in 1973, and since then have been widely studied. In particular, the problem of acyclic colourings of graphs with bounded maximum degree has been investigated. In 2011, Kostochka and Stocker showed that any graph with maximum degree 5 can be acyclically coloured with at most 7 colours. The question, whether this bound is achieved, remains open. In this note we prove that any graph with maximum degree 5 and maximum average degree at most 4 admits an acyclic 6-colouring. We also provide examples of graphs with these properties.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2013, 33, 1; 91-99
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    3-Paths in Graphs with Bounded Average Degree
    Autorzy:
    Jendrol, Stanislav
    Maceková, Mária
    Montassier, Mickaël
    Soták, Roman
    Powiązania:
    https://bibliotekanauki.pl/articles/31340952.pdf
    Data publikacji:
    2016-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    average degree
    structural property
    3-path
    degree sequence
    Opis:
    In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path uvw on three vertices u, v, and w is of type (i, j, k) if the degree of u (respectively v, w) is at most i (respectively j, k). We prove that every graph with minimum degree at least 2 and average degree strictly less than m contains a path of one of the types Moreover, no parameter of this description can be improved.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2016, 36, 2; 339-353
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      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