Autor: Bresar, Bostjan - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Arboreal structure and regular graphs of median-like classes
Autorzy:: Brešar, Bostjan
Powiązania:: https://bibliotekanauki.pl/articles/743403.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: median graph
tree
gatedness
amalgam
periphery
regular graph
Opis:: We consider classes of graphs that enjoy the following properties: they are closed for gated subgraphs, gated amalgamation and Cartesian products, and for any gated subgraph the inverse of the gate function maps vertices to gated subsets. We prove that any graph of such a class contains a peripheral subgraph which is a Cartesian product of two graphs: a gated subgraph of the graph and a prime graph minus a vertex. Therefore, these graphs admit a peripheral elimination procedure which is a generalization of analogous procedure in median graphs. We characterize regular graphs of these classes whenever they enjoy an additional property. As a corollary we derive that regular weakly median graphs are precisely Cartesian products in which each factor is a complete graph or a hyperoctahedron.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 2; 215-225
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: The periphery graph of a median graph
Autorzy:: Brešar, Boštjan
Changat, Manoj
Subhamathi, Ajitha
Tepeh, Aleksandra
Powiązania:: https://bibliotekanauki.pl/articles/744496.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: median graph
Cartesian product
geodesic
periphery
peripheral expansion
Opis:: The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are path-like median graphs with arbitrarily large geodetic number. Peripheral expansion with respect to periphery graph is also considered, and connections with the concept of crossing graph are established.
Źródło:: Discussiones Mathematicae Graph Theory; 2010, 30, 1; 17-32
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja