Temat: symmetric - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Undirected and directed graphs with near polynomial growth
Autorzy:: Trofimov, V.
Powiązania:: https://bibliotekanauki.pl/articles/743188.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: vertex-symmetric graph
vertex-symmetric directed graph
near polynomial growth
multivalued mapping
Opis:: The growth function of a graph with respect to a vertex is near polynomial if there exists a polynomial bounding it above for infinitely many positive integers. In the paper vertex-symmetric undirected graphs and vertex-symmetric directed graphs with coinciding in- and out-degrees are described in the case their growth functions are near polynomial.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 2; 383-391
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Tetravalent arc-transitive graphs of order $3p^2$
Autorzy:: Ghasemi, Mohsen
Powiązania:: https://bibliotekanauki.pl/articles/31231999.pdf
Data publikacji:: 2014-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: s-transitive graphs
symmetric graphs
Cayley graphs
Opis:: Let $s$ be a positive integer. A graph is s-transitive if its automorphism group is transitive on s-arcs but not on $(s + 1)$-arcs. Let $p$ be a prime. In this article a complete classification of tetravalent s-transitive graphs of order $3p^2$ is given.
Źródło:: Discussiones Mathematicae Graph Theory; 2014, 34, 3; 567-575
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Counterexample to a conjecture on the structure of bipartite partitionable graphs
Autorzy:: Gibson, Richard
Mynhardt, Christina
Powiązania:: https://bibliotekanauki.pl/articles/743437.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: domination
prism fixer
symmetric dominating set
bipartite graph
Opis:: A graph G is called a prism fixer if γ(G×K₂) = γ(G), where γ(G) denotes the domination number of G. A symmetric γ-set of G is a minimum dominating set D which admits a partition D = D₁∪ D₂ such that $V(G)-N[D_i] = D_j$, i,j = 1,2, i ≠ j. It is known that G is a prism fixer if and only if G has a symmetric γ-set.
Hartnell and Rall [On dominating the Cartesian product of a graph and K₂, Discuss. Math. Graph Theory 24 (2004), 389-402] conjectured that if G is a connected, bipartite graph such that V(G) can be partitioned into symmetric γ-sets, then G ≅ C₄ or G can be obtained from $K_{2t,2t}$ by removing the edges of t vertex-disjoint 4-cycles. We construct a counterexample to this conjecture and prove an alternative result on the structure of such bipartite graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2007, 27, 3; 527-540
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Symmetric Hamilton Cycle Decompositions of Complete Multigraphs
Autorzy:: Chitra, V.
Muthusamy, A.
Powiązania:: https://bibliotekanauki.pl/articles/29788703.pdf
Data publikacji:: 2013-09-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: complete multigraph
1-factor
symmetric Hamilton cycle
decomposition
Opis:: Let $n ≥ 3$ and $⋋ ≥ 1$ be integers. Let $⋋K_n$ denote the complete multigraph with edge-multiplicity $⋋$. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of $⋋K_{2m}$ for all even $⋋ ≥ 2$ and $m ≥ 2$. Also we show that there exists a symmetric Hamilton cycle decomposition of $⋋K_{2m} − F$ for all odd $⋋ ≥ 3$ and $m ≥ 2$. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition of $⋋K_n$ (respectively, $⋋K_n − F$, where $F$ is a 1-factor of $⋋K_n$) which exist if and only if $⋋(n − 1)$ is even (respectively, $⋋(n − 1)$ is odd), except the non-existence cases n ≡ 0 or 6 (mod 8) when ⋋ = 1
Źródło:: Discussiones Mathematicae Graph Theory; 2013, 33, 4; 695-707
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: Chromatic Properties of the Pancake Graphs
Autorzy:: Konstantinova, Elena
Powiązania:: https://bibliotekanauki.pl/articles/31341647.pdf
Data publikacji:: 2017-08-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: Pancake graph
Cayley graphs
symmetric group
chromatic number
total chromatic number
Opis:: Chromatic properties of the Pancake graphs P_n, n ⩾ 2, that are Cayley graphs on the symmetric group Sym_n generated by prefix-reversals are investigated in the paper. It is proved that for any n ⩾ 3 the total chromatic number of P_n is n, and it is shown that the chromatic index of P_n is n − 1. We present upper bounds on the chromatic number of the Pancake graphs P_n, which improve Brooks’ bound for n ⩾ 7 and Katlin’s bound for n ⩽ 28. Algorithms of a total n-coloring and a proper (n − 1)-coloring are given.
Źródło:: Discussiones Mathematicae Graph Theory; 2017, 37, 3; 777-787
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja