Temat: cyclic permutation - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On cyclically embeddable (n,n)-graphs
Autorzy:: Görlich, Agnieszka
Pilśniak, Monika
Woźniak, Mariusz
Powiązania:: https://bibliotekanauki.pl/articles/743383.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: packing of graphs
cyclic permutation
Opis:: An embedding of a simple graph G into its complement G̅ is a permutation σ on V(G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider the embeddable (n,n)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 1; 85-104
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: On cyclically embeddable graphs
Autorzy:: Woźniak, Mariusz
Powiązania:: https://bibliotekanauki.pl/articles/744160.pdf
Data publikacji:: 1999
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: packing of graphs
unicyclic graphs
cyclic permutation
Opis:: An embedding of a simple graph G into its complement G̅ is a permutation σ on V(G) such that if an edge xy belongs to E(G), then σ(x)σ(y) does not belong to E(G). In this note we consider some families of embeddable graphs such that the corresponding permutation is cyclic.
Źródło:: Discussiones Mathematicae Graph Theory; 1999, 19, 2; 241-248
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Cyclic Permutations in Determining Crossing Numbers
Autorzy:: Klešč, Marián
Staš, Michal
Powiązania:: https://bibliotekanauki.pl/articles/32222545.pdf
Data publikacji:: 2022-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph
drawing
crossing number
join product
cyclic permutation
Opis:: The crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. Recently, the crossing numbers of join products of two graphs have been studied. In the paper, we extend know results concerning crossing numbers of join products of small graphs with discrete graphs. The crossing number of the join product G*+ D_n for the disconnected graph G* consisting of five vertices and of three edges incident with the same vertex is given. Up to now, the crossing numbers of G + D_n were done only for connected graphs G. In the paper also the crossing numbers of G*+ P_n and G* + C_n are given. The paper concludes by giving the crossing numbers of the graphs H + D_n, H + P_n, and H + C_n for four different graphs H with |E(H)| ≤ |V (H)|. The methods used in the paper are new. They are based on combinatorial properties of cyclic permutations.
Źródło:: Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1163-1183
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja