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ę "infinite graph" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Arithmetically maximal independent sets in infinite graphs
    Autorzy:
    Bylka, Stanisław
    Powiązania:
    https://bibliotekanauki.pl/articles/744334.pdf
    Data publikacji:
    2005
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    infinite graph
    independent set
    arithmetical maximal set
    line graph
    Opis:
    Families of all sets of independent vertices in graphs are investigated. The problem how to characterize those infinite graphs which have arithmetically maximal independent sets is posed. A positive answer is given to the following classes of infinite graphs: bipartite graphs, line graphs and graphs having locally infinite clique-cover of vertices. Some counter examples are presented.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2005, 25, 1-2; 167-182
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cycle Double Covers of Infinite Planar Graphs
    Autorzy:
    Javaheri, Mohammad
    Powiązania:
    https://bibliotekanauki.pl/articles/31340892.pdf
    Data publikacji:
    2016-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    cycle double cover
    infinite planar graph
    Opis:
    In this paper, we study the existence of cycle double covers for infinite planar graphs. We show that every infinite locally finite bridgeless k-indivisible graph with a 2-basis admits a cycle double cover.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2016, 36, 3; 523-544
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Non symmetric random walk on infinite graph
    Autorzy:
    Zygmunt, M. J.
    Powiązania:
    https://bibliotekanauki.pl/articles/254997.pdf
    Data publikacji:
    2011
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    random walk on an infinite graph
    block tridiagonal transition matrix
    spectral measure matrix orthogonal polynomials
    Opis:
    We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
    Źródło:
    Opuscula Mathematica; 2011, 31, 4; 669-674
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On dually compact closed classes of graphs and BFS-constructible graphs
    Autorzy:
    Polat, Norbert
    Powiązania:
    https://bibliotekanauki.pl/articles/743184.pdf
    Data publikacji:
    2003
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    infinite graph
    dismantlable graph
    constructible graph
    BFS-cons-tructible graph
    variety
    weak-retract
    strong product
    bridged graph
    Helly graph
    weakly-modular graph
    dually compact closed class
    Opis:
    A class C of graphs is said to be dually compact closed if, for every infinite G ∈ C, each finite subgraph of G is contained in a finite induced subgraph of G which belongs to C. The class of trees and more generally the one of chordal graphs are dually compact closed. One of the main part of this paper is to settle a question of Hahn, Sands, Sauer and Woodrow by showing that the class of bridged graphs is dually compact closed. To prove this result we use the concept of constructible graph. A (finite or infinite) graph G is constructible if there exists a well-ordering ≤ (called constructing ordering) of its vertices such that, for every vertex x which is not the smallest element, there is a vertex y < x which is adjacent to x and to every neighbor z of x with z < x. Finite graphs are constructible if and only if they are dismantlable. The case is different, however, with infinite graphs. A graph G for which every breadth-first search of G produces a particular constructing ordering of its vertices is called a BFS-constructible graph. We show that the class of BFS-constructible graphs is a variety (i.e., it is closed under weak retracts and strong products), that it is a subclass of the class of weakly modular graphs, and that it contains the class of bridged graphs and that of Helly graphs (bridged graphs being very special instances of BFS-constructible graphs). Finally we show that the class of interval-finite pseudo-median graphs (and thus the one of median graphs) and the class of Helly graphs are dually compact closed, and that moreover every finite subgraph of an interval-finite pseudo-median graph (resp. a Helly graph) G is contained in a finite isometric pseudo-median (resp. Helly) subgraph of G. We also give two sufficient conditions so that a bridged graph has a similar property.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2003, 23, 2; 365-381
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An advance in infinite graph models for the analysis of transportation networks
    Autorzy:
    Cera, M.
    Fedriani, E. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330503.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    infinite graph
    average degree
    extremal problems
    road transport network
    percolation threshold
    graf nieskończony
    zagadnienie ekstremum
    sieć transportowa
    próg perkolacji
    Opis:
    This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph. It also relates the new results with the corresponding situations for the finite case. In particular, concepts from ‘finite’ graph theory, like the average degree and the extremal number, are generalized and computed for some specific cases. Finally, some applications of infinite graphs to the transportation of dangerous goods are presented; they involve the analysis of networks and percolation thresholds.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 855-869
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    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