Temat: degree condition - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On traceability and 2-factors in claw-free graphs
Autorzy:: Fronček, Dalibor
Ryjáček, Zdeněk
Skupień, Zdzisław
Powiązania:: https://bibliotekanauki.pl/articles/744410.pdf
Data publikacji:: 2004
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: traceability
2-factor
claw
degree condition
closure
Opis:: If G is a claw-free graph of sufficiently large order n, satisfying a degree condition σₖ > n + k² - 4k + 7 (where k is an arbitrary constant), then G has a 2-factor with at most k - 1 components. As a second main result, we present classes of graphs ₁,...,₈ such that every sufficiently large connected claw-free graph satisfying degree condition σ₆(k) > n + 19 (or, as a corollary, δ(G) > (n+19)/6) either belongs to $⋃ ⁸_{i=1} _i$ or is traceable.
Źródło:: Discussiones Mathematicae Graph Theory; 2004, 24, 1; 55-71
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: On distance local connectivity and vertex distance colouring
Autorzy:: Holub, Přemysl
Powiązania:: https://bibliotekanauki.pl/articles/743741.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: degree condition
distance local connectivity
distance chromatic number
Opis:: In this paper, we give some sufficient conditions for distance local connectivity of a graph, and a degree condition for local connectivity of a k-connected graph with large diameter. We study some relationships between t-distance chromatic number and distance local connectivity of a graph and give an upper bound on the t-distance chromatic number of a k-connected graph with diameter d.
Źródło:: Discussiones Mathematicae Graph Theory; 2007, 27, 2; 209-227
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: On a Spanning $k$-Tree in which Specified Vertices Have Degree Less Than $k$
Autorzy:: Matsumura, Hajime
Powiązania:: https://bibliotekanauki.pl/articles/31339152.pdf
Data publikacji:: 2015-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: spanning tree
degree bounded tree
degree sum condition
Opis:: A $k$-tree is a tree with maximum degree at most $k$. In this paper, we give a degree sum condition for a graph to have a spanning $k$-tree in which specified vertices have degree less than $k$. We denote by $\sigma_k(G)$ the minimum value of the degree sum of $k$ independent vertices in a graph $G$. Let $k ≥ 3$ and s $≥ 0$ be integers, and suppose $G$ is a connected graph and $\sigma_k(G) ≥ |V (G)|+s−1$. Then for any $s$ specified vertices, $G$ contains a spanning $k$-tree in which every specified vertex has degree less than $k$. The degree condition is sharp.
Źródło:: Discussiones Mathematicae Graph Theory; 2015, 35, 1; 191-196
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Autorzy:: Furuya, Michitaka
Maezawa, Shun-ichi
Matsubara, Ryota
Matsuda, Haruhide
Tsuchiya, Shoichi
Yashima, Takamasa
Powiązania:: https://bibliotekanauki.pl/articles/32361756.pdf
Data publikacji:: 2022-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: spanning tree
k -tree
star-free
degree sum condition
Opis:: For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G. Since a spanning 2-tree is a Hamiltonian path, a spanning k-tree is an extended concept of a Hamiltonian path. The first result, implying the existence of k-trees in star-free graphs, was by Caro, Krasikov, and Roditty in 1985, and independently, Jackson and Wormald in 1990, who proved that for any integer k with k ≥ 3, every connected K_1,k-free graph contains a spanning k-tree. In this paper, we focus on a sharp condition that guarantees the existence of a spanning k-tree in K_1,k+1-free graphs. In particular, we show that every connected K_1,k+1-free graph G has a spanning k-tree if the degree sum of any 3k−3 independent vertices in G is at least |G|−2, where |G| is the order of G.
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 1; 5-13
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: The Infestation Degree of Trees with Common Mistletoe Viscum album L. and their Health Status (on the Example of Praszka City)
Autorzy:: Gołąbek, E.
Sławiński, J.
Powiązania:: https://bibliotekanauki.pl/articles/123572.pdf
Data publikacji:: 2017
Wydawca:: Polskie Towarzystwo Inżynierii Ekologicznej
Tematy:: Viscum album L.
common mistletoe
degree of trees settlement
health condition of trees
Praszka
Opis:: The research was carried out in September and October 2013. Their main aim was to obtain the information on the abundance and distribution of the common mistletoe in Praszka, assess the health status of the trees infested with this semi-parasite, and to determine its impact on the health of the hosts. All the trees with mistletoe were examined (in terms of the species, the number of semiparasite shrubs, the host health). The distribution and density hosts were presented on a prepared network with an area of 1 ha and Pearson’s correlation factor was used to determine the relationship between the infestation degree of a host and its state of health. Only the typical subspecies of mistletoe – Viscum album L. subsp. album, which occupied 11 species of trees were found in the city of Praszka. These were mainly: black poplar Populus nigra L., small-leaved lime Tilia cordata L. and black locust Robinia pseudoacacia L. (they are also the most common or the frequent hosts in the country). The distribution of mistletoe in the city is uneven, and this is mainly due to the degree of urbanization, sunshine, noise, occurrence of the most common hosts as well as the presence of birds. It turned out that the largest groups of hosts were located along the roads in low building areas, on the peripheries of the city as well as in parks and cemeteries. The health condition of trees inhabited by mistletoe was generally good. There was a correlation between the number of mistletoe shrubs on the host and its health status (the greater the number of shrubs, the worse the health status of the host).
Źródło:: Journal of Ecological Engineering; 2017, 18, 6; 80-85
2299-8993
Pojawia się w:: Journal of Ecological Engineering
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Proposal for determing the scale of renovation needs of residential buildings
Propozycja określania skali potrzeb renowacji budynków mieszkalnych
Autorzy:: Nowogońska, B.
Powiązania:: https://bibliotekanauki.pl/articles/396492.pdf
Data publikacji:: 2016
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: renovation of buildings
technical condition
degree of wear
renovation needs
renowacja budynków
stan techniczny
stopień zużycia
potrzeby remontowe
Opis:: The scope of renovation works depends, above all, on the state in which a historical site has been preserved. All actions ought to be preceded by an assessment of the technical condition of the buildings. The article presents a method for determining the scale of needs for renovating existing buildings constructed in traditional technology. The established planning decision criteria, determined by measures of decision criteria and the weights of these criteria comprise output data for establishing a matrix of indicators for the order in which works ought to be carried out. Results of using it on inhabited residential buildings located in Gorzów Wielkopolski have also been presented.
Zakres zadań renowacyjnych zależy przede wszystkim od stanu zachowania zabytkowego miejsca. Wszelkie działania powinny być poprzedzone oceną stanu technicznego obiektów. W artykule została przedstawiona metoda określania rozmiaru potrzeb renowacji istniejących budynków, wykonanych w technologii tradycyjnej. Ustalone kryteria decyzyjne planowania prac renowacyjnych określone przez mierniki kryteriów decyzyjnych oraz wagi tych kryteriów stanowią dane wyjściowe do wyznaczania macierzy wskaźników kolejności wykonywania prac. W metodzie przyjęto następujące kryteria: stopień zużycia elementu budynku; struktura budynku; okres trwałości elementu; wpływ zniszczenia elementu na inne elementy; współzależność remontu elementu związana z remontem innego; lokalizacja obiektu; wartość kulturowa obiektu. Zaprezentowane zostały także wyniki wykorzystani zaproponowanej metody dla aktualnie użytkowanych budynków mieszkalnych zlokalizowanych w Gorzowie Wlkp.
Źródło:: Civil and Environmental Engineering Reports; 2016, No. 22(3); 137-144
2080-5187
2450-8594
Pojawia się w:: Civil and Environmental Engineering Reports
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Diagnosis of the Technical Condition of Historic Tenement Houses as the First Stage of Revitalisation of the City
Autorzy:: Nowogońska, Beata
Powiązania:: https://bibliotekanauki.pl/articles/1838068.pdf
Data publikacji:: 2020
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: revitalisation
technical condition assessment
technical wear degree
historic buildings
rewitalizacja
ocena stanu technicznego
stopień zużycia technicznego
budynki historyczne
Opis:: Revitalisation of degraded downtown areas is a problem for many cities and towns in Europe. All spatial, economic and social changes result from the expectations of residents together with technical needs. The scope of revitalisation activities results from the diagnosis of the technical condition of the degraded part of the city. The article presents a sample assessment of the technical condition of a tenement house in Kożuchów located within a downtown complex covered by revitalisation plans.
Źródło:: Civil and Environmental Engineering Reports; 2020, 30, 4; 102-110
2080-5187
2450-8594
Pojawia się w:: Civil and Environmental Engineering Reports
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: Solution of one initial-boundary Wentzel problem for a parabolic equation with discontinuous coefficients by the boundary integral equation method
Autorzy:: Kopytko, B.
Tsapovska, Z.
Powiązania:: https://bibliotekanauki.pl/articles/122876.pdf
Data publikacji:: 2017
Wydawca:: Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:: linear parabolic second-degree operator
potential method
conjugation condition of Wentzel type
problem początkowo-brzegowy
metoda potencjału
warunki brzegowe
warunek koniugacji
Opis:: In this article we consider the question of existence in the Holder class of the solution of the initial-boundary problem for a linear parabolic second-degree equation with discontinuous coefficients in noncylindrical domain. This domain is bounded of the smooth elementary surfaces of the Holder class H ^{2+λ, (2+λ )/2}. The boundary conditions and the conjugation condition of the Wentzel type are given to external and internal boundaries of a domain respectively. We use the potential method to solve this problem.
Źródło:: Journal of Applied Mathematics and Computational Mechanics; 2017, 16, 1; 51-62
2299-9965
Pojawia się w:: Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:: Biblioteka Nauki