Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "line digraph" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Radii and centers in iterated line digraphs
    Autorzy:
    Knor, Martin
    Niepel, L'udovít
    Powiązania:
    https://bibliotekanauki.pl/articles/972028.pdf
    Data publikacji:
    1996
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    center
    digraph
    line digraph
    radius
    Opis:
    We show that the out-radius and the radius grow linearly, or "almost" linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1996, 16, 1; 17-26
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Kernels in edge coloured line digraph
    Autorzy:
    Galeana-Sánchez, H.
    Pastrana Ramírez, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/744205.pdf
    Data publikacji:
    1998
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    kernel
    kernel by monochromatic paths
    line digraph
    edge coloured digraph
    Opis:
    We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A set N ⊆ V(D) is said to be a kernel by monochromatic paths if it satisfies the two following conditions (i) for every pair of different vertices u, v ∈ N there is no monochromatic directed path between them and (ii) for every vertex x ∈ V(D)-N there is a vertex y ∈ N such that there is an xy-monochromatic directed path.
    Let D be an m-coloured digraph and L(D) its line digraph. The inner m-coloration of L(D) is the edge coloration of L(D) defined as follows: If h is an arc of D of colour c, then any arc of the form (x,h) in L(D) also has colour c.
    In this paper it is proved that if D is an m-coloured digraph without monochromatic directed cycles, then the number of kernels by monochromatic paths in D is equal to the number of kernels by monochromatic paths in the inner edge coloration of L(D).
    Źródło:
    Discussiones Mathematicae Graph Theory; 1998, 18, 1; 91-98
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    (k,l)-kernels, (k,l)-semikernels, k-Grundy functions and duality for state splittings
    Autorzy:
    Galeana-Sánchez, Hortensia
    Gómez, Ricardo
    Powiązania:
    https://bibliotekanauki.pl/articles/743799.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    state splitting
    line digraph
    kernel
    Grundy function
    duality
    Opis:
    Line digraphs can be obtained by sequences of state splittings, a particular kind of operation widely used in symbolic dynamics [12]. Properties of line digraphs inherited from the source have been studied, for instance in [7] Harminc showed that the cardinalities of the sets of kernels and solutions (kernel's dual definition) of a digraph and its line digraph coincide. We extend this for (k,l)-kernels in the context of state splittings and also look at (k,l)-semikernels, k-Grundy functions and their duals.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2007, 27, 2; 359-371
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Isomorphisms and traversability of directed path graphs
    Autorzy:
    Broersma, Hajo
    Li, Xueliang
    Powiązania:
    https://bibliotekanauki.pl/articles/743350.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    directed path graph
    line digraph
    isomorphism
    travers-ability
    Opis:
    The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pₖ(D) of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k+1 vertices or form a directed cycle on k vertices in D. In this introductory paper several properties of P₃(D) are studied, in particular with respect to isomorphism and traversability. In our main results, we characterize all digraphs D with P₃(D) ≅ D, we show that P₃(D₁) ≅ P₃(D₂) "almost always" implies D₁ ≅ D₂, and we characterize all digraphs with Eulerian or Hamiltonian P₃-graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2002, 22, 2; 215-228
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Kernels in monochromatic path digraphs
    Autorzy:
    Galeana-Sánchez, Hortensia
    Ramírez, Laura
    Mejía, Hugo
    Powiązania:
    https://bibliotekanauki.pl/articles/744174.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    kernel
    line digraph
    kernel by monochromatic paths
    monochromatic path digraph
    edge-coloured digraph
    Opis:
    We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. Let D be an m-coloured digraph. A set N ⊆ V(D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions:
    (i) for every pair of different vertices u,v ∈ N there is no monochromatic directed path between them and
    (ii) for each vertex x ∈ (V(D)-N) there is a vertex y ∈ N such that there is an xy-monochromatic directed path.
    In this paper is defined the monochromatic path digraph of D, MP(D), and the inner m-colouration of MP(D). Also it is proved that if D is an m-coloured digraph without monochromatic directed cycles, then the number of kernels by monochromatic paths in D is equal to the number of kernels by monochromatic paths in the inner m-colouration of MP(D). A previous result is generalized.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2005, 25, 3; 407-417
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies