Autor: Zmazek, Blaž - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Median and quasi-median direct products of graphs
Autorzy:: Brešar, Boštjan
Jha, Pranava
Klavžar, Sandi
Zmazek, Blaž
Powiązania:: https://bibliotekanauki.pl/articles/744332.pdf
Data publikacji:: 2005
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: median graph
direct product
quasi-median graph
isometric embeddings
convexity
Opis:: Median graphs are characterized among direct products of graphs on at least three vertices. Beside some trivial cases, it is shown that one component of G×P₃ is median if and only if G is a tree in that the distance between any two vertices of degree at least 3 is even. In addition, some partial results considering median graphs of the form G×K₂ are proved, and it is shown that the only nonbipartite quasi-median direct product is K₃×K₃.
Źródło:: Discussiones Mathematicae Graph Theory; 2005, 25, 1-2; 183-196
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Weak k-reconstruction of Cartesian products
Autorzy:: Imrich, Wilfried
Zmazek, Blaz
Zerovnik, Janez
Powiązania:: https://bibliotekanauki.pl/articles/743162.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: reconstruction problem
Cartesian product
composite graphs
Opis:: By Ulam's conjecture every finite graph G can be reconstructed from its deck of vertex deleted subgraphs. The conjecture is still open, but many special cases have been settled. In particular, one can reconstruct Cartesian products. We consider the case of k-vertex deleted subgraphs of Cartesian products, and prove that one can decide whether a graph H is a k-vertex deleted subgraph of a Cartesian product G with at least k+1 prime factors on at least k+1 vertices each, and that H uniquely determines G. This extends previous work of the authors and Sims. The paper also contains a counterexample to a conjecture of MacAvaney.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 2; 273-285
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Isomorphic components of Kronecker product of bipartite graphs
Autorzy:: Jha, Pranava
Klavžar, Sandi
Zmazek, Blaž
Powiązania:: https://bibliotekanauki.pl/articles/971945.pdf
Data publikacji:: 1997
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: Kronecker product
bipartite graphs
graph isomorphism
Opis:: Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.
Źródło:: Discussiones Mathematicae Graph Theory; 1997, 17, 2; 301-309
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: Recognizing weighted directed cartesian graph bundles
Autorzy:: Zmazek, Blaz
Zerovnik, Janez
Powiązania:: https://bibliotekanauki.pl/articles/743682.pdf
Data publikacji:: 2000
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: graph bundles
Cartesian graph product
weighted digraphs
half-convexity
Opis:: In this paper we show that methods for recognizing Cartesian graph bundles can be generalized to weighted digraphs. The main result is an algorithm which lists the sets of degenerate arcs for all representations of digraph as a weighted directed Cartesian graph bundle over simple base digraphs not containing transitive tournament on three vertices. Two main notions are used. The first one is the new relation $^→δ*$defined among the arcs of a digraph as a weighted directed analogue of the well-known relation δ*. The second one is the concept of half-convex subgraphs. A subgraph H is half-convex in G if any vertex x ∈ G∖H has at most one predecessor and at most one successor.
Źródło:: Discussiones Mathematicae Graph Theory; 2000, 20, 1; 39-56
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja