Wszystkie pola: prime - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A prime factor theorem for a generalized direct product
Autorzy:: Imrich, Wilfried
Stadler, Peter
Powiązania:: https://bibliotekanauki.pl/articles/743894.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: products
set systems
prime factor theorem
Opis:: We introduce the concept of neighborhood systems as a generalization of directed, reflexive graphs and show that the prime factorization of neighborhood systems with respect to the the direct product is unique under the condition that they satisfy an appropriate notion of thinness.
Źródło:: Discussiones Mathematicae Graph Theory; 2006, 26, 1; 135-140
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Prime ideals in the lattice of additive induced-hereditary graph properties
Autorzy:: Berger, Amelie
Mihók, Peter
Powiązania:: https://bibliotekanauki.pl/articles/743387.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: hereditary graph property
prime ideal
distributive lattice
induced subgraphs
Opis:: An additive induced-hereditary property of graphs is any class of finite simple graphs which is closed under isomorphisms, disjoint unions and induced subgraphs. The set of all additive induced-hereditary properties of graphs, partially ordered by set inclusion, forms a completely distributive lattice. We introduce the notion of the join-decomposability number of a property and then we prove that the prime ideals of the lattice of all additive induced-hereditary properties are divided into two groups, determined either by a set of excluded join-irreducible properties or determined by a set of excluded properties with infinite join-decomposability number. We provide non-trivial examples of each type.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 1; 117-127
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Prime Factorization And Domination In The Hierarchical Product Of Graphs
Autorzy:: Anderson, S.E.
Guob, Y.
Tenney, A.
Wash, K.A.
Powiązania:: https://bibliotekanauki.pl/articles/31341604.pdf
Data publikacji:: 2017-11-27
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: generalized hierarchical product
Cartesian product
prime fac- tor decomposition
Opis:: In 2009, Barrière, Dalfó, Fiol, and Mitjana introduced the generalized hierarchical product of graphs. This operation is a generalization of the Cartesian product of graphs. It is known that every connected graph has a unique prime factor decomposition with respect to the Cartesian product. We generalize this result to show that connected graphs indeed have a unique prime factor decomposition with respect to the generalized hierarchical product. We also give preliminary results on the domination number of generalized hierarchical products.
Źródło:: Discussiones Mathematicae Graph Theory; 2017, 37, 4; 873-890
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: On Semisymmetric Cubic Graphs of Order 20p², p Prime
Autorzy:: Shahsavaran, Mohsen
Darafsheh, Mohammad Reza
Powiązania:: https://bibliotekanauki.pl/articles/32222726.pdf
Data publikacji:: 2021-11-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: edge-transitive graph
vertex-transitive graph
semisymmetric graph
order of a graph
classification of cubic semisymmetric graphs
Opis:: A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be an arbitrary prime. Folkman proved [Regular line-symmetric graphs, J. Combin. Theory 3 (1967) 215–232] that there is no semisymmetric graph of order 2p or 2p². In this paper an extension of his result in the case of cubic graphs of order 20p² is given. We prove that there is no connected cubic semisymmetric graph of order 20p² or, equivalently, that every connected cubic edge-transitive graph of order 20p² is necessarily symmetric.
Źródło:: Discussiones Mathematicae Graph Theory; 2021, 41, 4; 873-891
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja