Temat: permutation graph - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: On Lees conjecture and some results
Autorzy:: Fan, Lixia
Liang, Zhihe
Powiązania:: https://bibliotekanauki.pl/articles/744426.pdf
Data publikacji:: 2009
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: permutation graph
graceful, Lee's conjecture
Opis:: S.M. Lee proposed the conjecture: for any n > 1 and any permutation f in S(n), the permutation graph P(Pₙ,f) is graceful. For any integer n > 1 and permutation f in S(n), we discuss the gracefulness of the permutation graph P(Pₙ,f) if $f = ∏_{k = 0}^{l-1} (m+2k, m+2k+1)$, and $∏_{k=0}^{l-1} (m+4k,m+4k+2)(m+4k+1,m+4k+3)$ for any positive integers m and l.
Źródło:: Discussiones Mathematicae Graph Theory; 2009, 29, 3; 481-498
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Edge-disjoint paths in permutation graphs
Autorzy:: Gopalakrishnan, C.
Pandu Rangan, C.
Powiązania:: https://bibliotekanauki.pl/articles/971918.pdf
Data publikacji:: 1995
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: algorithm
bridge
connectivity
disjoint paths
permutation graph
Opis:: In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two edge-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂, respectively. We give a linear (O(|V|+|E|)) algorithm to solve this problem on a permutation graph.
Źródło:: Discussiones Mathematicae Graph Theory; 1995, 15, 1; 59-72
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: A linear algorithm for the two paths problem on permutation graphs
Autorzy:: Gopalakrishnan, C.
Pandu Rangan, C.
Powiązania:: https://bibliotekanauki.pl/articles/972048.pdf
Data publikacji:: 1995
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: algorithm
bridge
connectivity
disjoint paths
permutation graph
two paths problem
Opis:: The 'two paths problem' is stated as follows. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two vertex-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂ respectively. In this paper we give a linear (O(|V|+ |E|)) algorithm to solve the above problem on a permutation graph.
Źródło:: Discussiones Mathematicae Graph Theory; 1995, 15, 2; 147-166
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Coverings of Cubic Graphs and 3-Edge Colorability
Autorzy:: Plachta, Leonid
Powiązania:: https://bibliotekanauki.pl/articles/32083839.pdf
Data publikacji:: 2021-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: uncolorable cubic graph
covering of graphs
voltage permutation graph
resistance
nowhere-zero 4-flow
Opis:: Let $h:\tilde{G}→G$ be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which $\tilde{G}$ is 3-edge uncolorable. As particular cases, we have constructed regular and irregular 5-fold coverings $f:\tilde{G}→G$ of uncolorable cyclically 4-edge connected cubic graphs and an irregular 5-fold covering $g:\tilde{H}→H$ of uncolorable cyclically 6-edge connected cubic graphs. In [13], Steffen introduced the resistance of a subcubic graph, a characteristic that measures how far is this graph from being 3-edge colorable. In this paper, we also study the relation between the resistance of the base cubic graph and the covering cubic graph.
Źródło:: Discussiones Mathematicae Graph Theory; 2021, 41, 1; 311-334
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

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