Temat: median - 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ł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: On θ-graphs of partial cubes
Autorzy:: Klavžar, Sandi
Kovse, Matjaz
Powiązania:: https://bibliotekanauki.pl/articles/743784.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: intersection graph
partial cube
median graph
expansion theorem
Cartesian product of graphs
Opis:: The Θ-graph Θ(G) of a partial cube G is the intersection graph of the equivalence classes of the Djoković-Winkler relation. Θ-graphs that are 2-connected, trees, or complete graphs are characterized. In particular, Θ(G) is complete if and only if G can be obtained from K₁ by a sequence of (newly introduced) dense expansions. Θ-graphs are also compared with familiar concepts of crossing graphs and τ-graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2007, 27, 2; 313-321
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Tree-like isometric subgraphs of hypercubes
Autorzy:: Brešar, Bostjan
Imrich, Wilfried
Klavžar, Sandi
Powiązania:: https://bibliotekanauki.pl/articles/743405.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: isometric embeddings
partial cubes
expansion procedures
trees
median graphs
graph automorphisms
automorphism groups
dismantlable graphs
Opis:: Tree-like isometric subgraphs of hypercubes, or tree-like partial cubes as we shall call them, are a generalization of median graphs. Just as median graphs they capture numerous properties of trees, but may contain larger classes of graphs that may be easier to recognize than the class of median graphs. We investigate the structure of tree-like partial cubes, characterize them, and provide examples of similarities with trees and median graphs. For instance, we show that the cube graph of a tree-like partial cube is dismantlable. This in particular implies that every tree-like partial cube G contains a cube that is invariant under every automorphism of G. We also show that weak retractions preserve tree-like partial cubes, which in turn implies that every contraction of a tree-like partial cube fixes a cube. The paper ends with several Frucht-type results and a list of open problems.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 2; 227-240
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "median" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język