Temat: permutation graphs - Katalog OPAC zbiorów

Skocz do pozycji: 1.

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: 2.

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: 3.

Tytuł:: Domination in functigraphs
Autorzy:: Eroh, Linda
Gera, Ralucca
Kang, Cong
Larson, Craig
Yi, Eunjeong
Powiązania:: https://bibliotekanauki.pl/articles/743330.pdf
Data publikacji:: 2012
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domination
permutation graphs
generalized prisms
functigraphs
Opis:: Let G₁ and G₂ be disjoint copies of a graph G, and let f:V(G₁) → V(G₂) be a function. Then a functigraph C(G,f) = (V,E) has the vertex set V = V(G₁) ∪ V(G₂) and the edge set E = E(G₁) ∪ E(G₂) ∪ {uv | u ∈ V(G₁), v ∈ V(G₂),v = f(u)}. A functigraph is a generalization of a permutation graph (also known as a generalized prism) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let γ(G) denote the domination number of G. It is readily seen that γ(G) ≤ γ(C(G,f)) ≤ 2 γ(G). We investigate for graphs generally, and for cycles in great detail, the functions which achieve the upper and lower bounds, as well as the realization of the intermediate values.
Źródło:: Discussiones Mathematicae Graph Theory; 2012, 32, 2; 299-319
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Labeled Embedding Of (n, n-2)-Graphs In Their Complements
Autorzy:: Tahraoui, M.-A.
Duchêne, E.
Kheddouci, H.
Powiązania:: https://bibliotekanauki.pl/articles/31341583.pdf
Data publikacji:: 2017-11-27
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: packing of graphs
labeled packing
permutation
Opis:: Graph packing generally deals with unlabeled graphs. In [4], the authors have introduced a new variant of the graph packing problem, called the labeled packing of a graph. This problem has recently been studied on trees [M.A. Tahraoui, E. Duchêne and H. Kheddouci, Labeled 2-packings of trees, Discrete Math. 338 (2015) 816-824] and cycles [E. Duchˆene, H. Kheddouci, R.J. Nowakowski and M.A. Tahraoui, Labeled packing of graphs, Australas. J. Combin. 57 (2013) 109-126]. In this note, we present a lower bound on the labeled packing number of any (n, n − 2)-graph into K_n. This result improves the bound given by Woźniak in [Embedding graphs of small size, Discrete Appl. Math. 51 (1994) 233-241].
Źródło:: Discussiones Mathematicae Graph Theory; 2017, 37, 4; 1015-1025
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

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ł

Informacja