Temat: factor of graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Reactive power compensation for non-traction railway consumers
Autorzy:: Mukha, Andrii M.
Bondar, Oleh I.
Powiązania:: https://bibliotekanauki.pl/articles/215138.pdf
Data publikacji:: 2020
Wydawca:: Instytut Kolejnictwa
Tematy:: non-traction consumer
power factor corrector
reactive power compensator
graph of electric network
nodal analysis
Opis:: This paper deals with the problems of power supply efficiency for non-traction railway customers. Unlike public distribution networks, the non-traction power supply network is within the zone of influence of electromagnetic fields and the conductive influence of the distorted traction current. As a result, poor power quality and additional losses are typical for non-traction railway networks. Subsequently, conflicts due to the low quality of electricity may arise between the railway and its customers powered by the distribution networks of the railway. The influence of a reactive power compensation device on the voltage drop in a non-traction power line is investigated in the article. The implementation of reactive power compensation allows voltage losses during its transmission to the final consumer to be reduced by almost 5% and electricity losses by 3%.
Źródło:: Problemy Kolejnictwa; 2020, 188; 129-135
0552-2145
2544-9451
Pojawia się w:: Problemy Kolejnictwa
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Strong Tutte Type Conditions and Factors of Graphs
Autorzy:: Yan, Zheng
Kano, Mikio
Powiązania:: https://bibliotekanauki.pl/articles/31348133.pdf
Data publikacji:: 2020-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: factor of graph
even factor
regular factor
Tutte type condition
Opis:: Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give sufficient conditions using odd(G − S) for a graph G to have an even factor. Moreover, we show that if a graph G satisfies odd(G − S) ≤ max{1, (1/k)|S|} for all S ⊂ V (G), then G has a (k − 1)-regular factor for k ≥ 3 or an H-factor for k = 2, where we say that G has an H-factor if for every labeling h : V (G) → {red, blue} with #{v ∈ V (G) : f(v) = red} even, G has a spanning subgraph F such that deg_F (x) = 1 if h(x) = red and deg_F (x) ∈ {0, 2} otherwise.
Źródło:: Discussiones Mathematicae Graph Theory; 2020, 40, 4; 1057-1065
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Strong ƒ-Star Factors of Graphs
Autorzy:: Yan, Zheng
Powiązania:: https://bibliotekanauki.pl/articles/31339350.pdf
Data publikacji:: 2015-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: ƒ-star factor
strong ƒ-star factor
complete-cactus
factor of graph
Opis:: Let G be a graph and f : V (G) → {2, 3, . . .}. A spanning subgraph F is called strong f-star of G if each component of F is a star whose center x satisfies deg_F (x) ≤ ƒ(x) and F is an induced subgraph of G. In this paper, we prove that G has a strong f-star factor if and only if oddca(G − S) ≤ ∑_x∊S ƒ(x) for all S ⊂ V (G), where oddca(G) denotes the number of odd complete-cacti of G.
Źródło:: Discussiones Mathematicae Graph Theory; 2015, 35, 3; 475-482
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Star-Cycle Factors of Graphs
Autorzy:: Egawa, Yoshimi
Kano, Mikio
Yan, Zheng
Powiązania:: https://bibliotekanauki.pl/articles/30147223.pdf
Data publikacji:: 2014-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: star factor
cycle factor
star-cycle factor
factor of graph
Opis:: A spanning subgraph $F$ of a graph $G$ is called a star-cycle factor of $G$ if each component of $F$ is a star or cycle. Let $G$ be a graph and $f : V (G) → {1, 2, 3, . . .}$ be a function. Let $W = {v ∈ V (G) : f(v) = 1}$. Under this notation, it was proved by Berge and Las Vergnas that G has a star-cycle factor $F$ with the property that (i) if a component $D$ of $F$ is a star with center $v$, then $deg_F (v) ≤ f(v)$, and (ii) if a component $D$ of $F$ is a cycle, then $V (D) ⊆ W$ if and only if $iso(G − S) ≤ Σ_{x∈S} f(x)$ for all $S ⊂ V (G)$, where $iso(G − S)$ denotes the number of isolated vertices of $G − S$. They proved this result by using circulation theory of flows and fractional factors of graphs. In this paper, we give an elementary and short proof of this theorem.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 1; 193-198
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: Partitions of a graph into cycles containing a specified linear forest
Autorzy:: Matsubara, Ryota
Matsumura, Hajime
Powiązania:: https://bibliotekanauki.pl/articles/743517.pdf
Data publikacji:: 2008
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: partition of a graph
vertex-disjoint cycle
2-factor
linear forest
Opis:: In this note, we consider the partition of a graph into cycles containing a specified linear forest. Minimum degree and degree sum conditions are given, which are best possible.
Źródło:: Discussiones Mathematicae Graph Theory; 2008, 28, 1; 97-107
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 6.

Tytuł:: Colouring of cycles in the de Bruijn graphs
Autorzy:: Łazuka, Ewa
Żurawiecki, Jerzy
Powiązania:: https://bibliotekanauki.pl/articles/743669.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: the de Bruijn graph
decomposition
colouring of edges in a cycle
factors of the de Bruijn graph
locally reducible factor
feedback function
locally reducible function
Opis:: We show that the problem of finding the family of all so called the locally reducible factors in the binary de Bruijn graph of order k is equivalent to the problem of finding all colourings of edges in the binary de Bruijn graph of order k-1, where each vertex belongs to exactly two cycles of different colours. In this paper we define and study such colouring for the greater class of the de Bruijn graphs in order to define a class of so called regular factors, which is not so difficult to construct. Next we prove that each locally reducible factor of the binary de Bruijn graph is a subgraph of a certain regular factor in the m-ary de Bruijn graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2000, 20, 1; 5-21
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja