Wszystkie pola: Mulder, Henry - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A Note on the Interval Function of a Disconnected Graph
Autorzy:: Changat, Manoj
Hossein Nezhad, Ferdoos
Mulder, Henry Martyn
Narayanan, N.
Powiązania:: https://bibliotekanauki.pl/articles/31342443.pdf
Data publikacji:: 2018-02-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: interval function
transit function
axiomatic characterization
disconnected graph
Opis:: In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.
Źródło:: Discussiones Mathematicae Graph Theory; 2018, 38, 1; 39-48
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Path-Neighborhood Graphs
Autorzy:: Laskar, R.C.
Mulder, Henry Martyn
Powiązania:: https://bibliotekanauki.pl/articles/30098149.pdf
Data publikacji:: 2013-09-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: path-neighborhood graph
outerplanar graph
MOP
snake
3- sun
k-fun
Opis:: A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized. The 3-sun is obtained from a 6-cycle by adding three chords between the three pairs of vertices at distance 2. A $ P_k $-graph is a path-neighborhood graph in which every neighborhood is a $ P_k $, where $ P_k $ is the path on $ k $ vertices. The $ P_k $-graphs are characterized for $ k \leq 4 $.
Źródło:: Discussiones Mathematicae Graph Theory; 2013, 33, 4; 731-745
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Leaps: an approach to the block structure of a graph
Autorzy:: Mulder, Henry
Nebeský, Ladislav
Powiązania:: https://bibliotekanauki.pl/articles/743877.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: leap
leap operation
block
cut-vertex
block closure
block graph
Opis:: To study the block structure of a connected graph G = (V,E), we introduce two algebraic approaches that reflect this structure: a binary operation + called a leap operation and a ternary relation L called a leap system, both on a finite, nonempty set V. These algebraic structures are easily studied by considering their underlying graphs, which turn out to be block graphs. Conversely, we define the operation $+_G$ as well as the set of leaps $L_G$ of the connected graph G. The underlying graph of $+_G$, as well as that of $L_G$, turns out to be just the block closure of G (i.e., the graph obtained by making each block of G into a complete subgraph).
Źródło:: Discussiones Mathematicae Graph Theory; 2006, 26, 1; 77-90
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: On 3-simplicial vertices in planar graphs
Autorzy:: Boros, Endre
Jamison, Robert
Laskar, Renu
Mulder, Henry
Powiązania:: https://bibliotekanauki.pl/articles/744547.pdf
Data publikacji:: 2004
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: planar graph
outerplanar graph
3-simplicial vertex
Opis:: A vertex v in a graph G = (V,E) is k-simplicial if the neighborhood N(v) of v can be vertex-covered by k or fewer complete graphs. The main result of the paper states that a planar graph of order at least four has at least four 3-simplicial vertices of degree at most five. This result is a strengthening of the classical corollary of Euler's Formula that a planar graph of order at least four contains at least four vertices of degree at most five.
Źródło:: Discussiones Mathematicae Graph Theory; 2004, 24, 3; 413-421
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 5.

Tytuł:: Modular and median signpost systems and their underlying graphs
Autorzy:: Mulder, Henry
Nebeský, Ladislav
Powiązania:: https://bibliotekanauki.pl/articles/743171.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: signpost system
modular graph
median graph
Opis:: The concept of a signpost system on a set is introduced. It is a ternary relation on the set satisfying three fairly natural axioms. Its underlying graph is introduced. When the underlying graph is disconnected some unexpected things may happen. The main focus are signpost systems satisfying some extra axioms. Their underlying graphs have lots of structure: the components are modular graphs or median graphs. Yet another axiom guarantees that the underlying graph is also connected. The main results of this paper concern if-and-only-if characterizations involving signpost systems satisfying additional axioms on the one hand and modular, respectively median graphs on the other hand.
Źródło:: Discussiones Mathematicae Graph Theory; 2003, 23, 2; 309-324
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja