Wszystkie pola: labelling trees - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Extensions of the minimum labelling spanning tree problem
Autorzy:: Cerulli, R.
Fink, A.
Gentili, M.
Voss, S.
Powiązania:: https://bibliotekanauki.pl/articles/308930.pdf
Data publikacji:: 2006
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: network design
metaheuristics
spanning trees
labelling trees
Steiner tree problem
Opis:: In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected subgraph of G with the minimum number of different colors covering all the basic vertices. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by means of homogeneous connections. Numerical results for several metaheuristics to solve the problem are presented.
Źródło:: Journal of Telecommunications and Information Technology; 2006, 4; 39-45
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Cyclic decompositions of complete graphs into spanning trees
Autorzy:: Froncek, Dalibor
Powiązania:: https://bibliotekanauki.pl/articles/744515.pdf
Data publikacji:: 2004
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph factorization
graph labelling
spanning trees
Opis:: We examine decompositions of complete graphs with an even number of vertices, $K_{2n}$, into n isomorphic spanning trees. While methods of such decompositions into symmetric trees have been known, we develop here a more general method based on a new type of vertex labelling, called flexible q-labelling. This labelling is a generalization of labellings introduced by Rosa and Eldergill.
Źródło:: Discussiones Mathematicae Graph Theory; 2004, 24, 2; 345-353
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Total edge irregularity strength of trees
Autorzy:: Ivančo, Jaroslav
Jendrol', Stanislav
Powiązania:: https://bibliotekanauki.pl/articles/743612.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph labelling
tree
irregularity strength
total labellings
total edge irregularity strength
Opis:: A total edge-irregular k-labelling ξ:V(G)∪ E(G) → {1,2,...,k} of a graph G is a labelling of vertices and edges of G in such a way that for any different edges e and f their weights wt(e) and wt(f) are distinct. The weight wt(e) of an edge e = xy is the sum of the labels of vertices x and y and the label of the edge e. The minimum k for which a graph G has a total edge-irregular k-labelling is called the total edge irregularity strength of G, tes(G). In this paper we prove that for every tree T of maximum degree Δ on p vertices
tes(T) = max{⎡(p+1)/3⎤,⎡(Δ+1)/2⎤}.
Źródło:: Discussiones Mathematicae Graph Theory; 2006, 26, 3; 449-456
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja