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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    Graphs with Unique Maximum Packing of Closed Neighborhoods
    Autorzy:
    Božović, Dragana
    Peterin, Iztok
    Powiązania:
    https://bibliotekanauki.pl/articles/32304193.pdf
    Data publikacji:
    2022-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    unique maximum packing
    closed neighborhoods
    trees
    Opis:
    A packing of a graph G is a subset P of the vertex set of G such that the closed neighborhoods of any two distinct vertices of P do not intersect. We study graphs with a unique packing of the maximum cardinality. We present several general properties for such graphs. These properties are used to characterize the trees with a unique maximum packing. Two characterizations are presented where one of them is inductive based on five operations.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 3; 779-797
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Chromatic polynomials of hypergraphs
    Autorzy:
    Borowiecki, Mieczysław
    Łazuka, Ewa
    Powiązania:
    https://bibliotekanauki.pl/articles/743817.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    chromatic polynomial
    chromatically unique hypergraphs
    chromatic characterization
    Opis:
    In this paper we present some hypergraphs which are chromatically characterized by their chromatic polynomials. It occurs that these hypergraphs are chromatically unique. Moreover we give some equalities for the chromatic polynomials of hypergraphs generalizing known results for graphs and hypergraphs of Read and Dohmen.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2000, 20, 2; 293-301
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Extremal bipartite graphs with a unique k-factor
    Autorzy:
    Hoffmann, Arne
    Sidorowicz, Elżbieta
    Volkmann, Lutz
    Powiązania:
    https://bibliotekanauki.pl/articles/743924.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    unique k-factor
    bipartite graphs
    extremal graphs
    Opis:
    Given integers p > k > 0, we consider the following problem of extremal graph theory: How many edges can a bipartite graph of order 2p have, if it contains a unique k-factor? We show that a labeling of the vertices in each part exists, such that at each vertex the indices of its neighbours in the factor are either all greater or all smaller than those of its neighbours in the graph without the factor. This enables us to prove that every bipartite graph with a unique k-factor and maximal size has exactly 2k vertices of degree k and 2k vertices of degree (|V(G)|)/2. As our main result we show that for k ≥ 1, p ≡ t mod k, 0 ≤ t < k, a bipartite graph G of order 2p with a unique k-factor meets 2|E(G)| ≤ p(p+k)-t(k-t). Furthermore, we present the structure of extremal graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2006, 26, 2; 181-192
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Unique factorisation of additive induced-hereditary properties
    Autorzy:
    Farrugia, Alastair
    Richter, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/744519.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    additive and hereditary graph classes
    unique factorization
    Opis:
    An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ₁,...,ₙ be additive hereditary graph properties. A graph G has property (₁∘...∘ₙ) if there is a partition (V₁,...,Vₙ) of V(G) into n sets such that, for all i, the induced subgraph $G[V_i]$ is in $_i$. A property is reducible if there are properties , such that = ∘ ; otherwise it is irreducible. Mihók, Semanišin and Vasky [8] gave a factorisation for any additive hereditary property into a given number dc() of irreducible additive hereditary factors. Mihók [7] gave a similar factorisation for properties that are additive and induced-hereditary (closed under taking induced-subgraphs and disjoint unions). Their results left open the possiblity of different factorisations, maybe even with a different number of factors; we prove here that the given factorisations are, in fact, unique.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2004, 24, 2; 319-343
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Unique-Maximum Coloring Of Plane Graphs
    Autorzy:
    Fabrici, Igor
    Göring, Frank
    Powiązania:
    https://bibliotekanauki.pl/articles/31341171.pdf
    Data publikacji:
    2016-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    plane graph
    weak-parity coloring
    unique-maximum coloring
    Opis:
    A unique-maximum k-coloring with respect to faces of a plane graph G is a coloring with colors 1, . . ., k so that, for each face of G, the maximum color occurs exactly once on the vertices of α. We prove that any plane graph is unique-maximum 3-colorable and has a proper unique-maximum coloring with 6 colors.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2016, 36, 1; 95-102
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Unique factorization theorem for object-systems
    Autorzy:
    Mihók, Peter
    Semanišin, Gabriel
    Powiązania:
    https://bibliotekanauki.pl/articles/743977.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    object-system
    unique factorization
    graph
    hypergraph
    formal concept analysis
    Opis:
    The concept of an object-system is a common generalization of simple graph, digraph and hypergraph. In the theory of generalised colourings of graphs, the Unique Factorization Theorem (UFT) for additive induced-hereditary properties of graphs provides an analogy of the well-known Fundamental Theorem of Arithmetics. The purpose of this paper is to present UFT for object-systems. This result generalises known UFT for additive induced-hereditary and hereditary properties of graphs and digraphs. Formal Concept Analysis is applied in the proof.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2011, 31, 3; 559-575
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Equivalent classes for K₃-gluings of wheels
    Autorzy:
    Bielak, Halina
    Powiązania:
    https://bibliotekanauki.pl/articles/744201.pdf
    Data publikacji:
    1998
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    chromatically equivalent graphs
    chromatic polynomial
    chromatically unique graphs
    wheels
    Opis:
    In this paper, the chromaticity of K₃-gluings of two wheels is studied. For each even integer n ≥ 6 and each odd integer 3 ≤ q ≤ [n/2] all K₃-gluings of wheels $W_{q+2}$ and $W_{n-q+2}$ create an χ-equivalent class.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1998, 18, 1; 73-84
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six
    Autorzy:
    Bielak, Halina
    Powiązania:
    https://bibliotekanauki.pl/articles/744207.pdf
    Data publikacji:
    1998
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    chromatically equivalent graphs
    chromatic polynomial
    chromatically unique graphs
    cyclomatic number
    Opis:
    In this note, all chromatic equivalence classes for 2-connected 3-chromatic graphs with five triangles and cyclomatic number six are described. New families of chromatically unique graphs of order n are presented for each n ≥ 8. This is a generalization of a result stated in [5]. Moreover, a proof for the conjecture posed in [5] is given.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1998, 18, 1; 99-111
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Branch-Weight Unique Trees
    Autorzy:
    Shang, Jen-Ling
    Powiązania:
    https://bibliotekanauki.pl/articles/32361727.pdf
    Data publikacji:
    2022-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    branch-weight
    branch-weight sequence
    branch-weight unique
    tree
    spider
    Opis:
    A branch at a vertex x in a tree is a maximal subtree containing x as an endvertex. The branch-weight of x is the maximum number of edges in any branch at x. The branch-weight sequence of a tree is the multiset consisting of the branch-weights of all vertices arranged in nonincreasing order. Non-isomorphic trees may have the same branch-weight sequence. A tree T is said to be branch-weight unique in a family of trees if T is uniquely determined in the family by its branch-weight sequence. A spider is a tree in which exactly one vertex has degree exceeding two. It is known that spiders are branch-weight unique in the family of spiders but not in the family of all trees. In this study, a necessary and sufficient condition is obtained whereby a spider may be branch-weight unique in the family of all trees. Moreover, two types of trees are proposed to be branch-weight unique in the family of all trees.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2022, 42, 2; 405-416
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On generating sets of induced-hereditary properties
    Autorzy:
    Semanišin, Gabriel
    Powiązania:
    https://bibliotekanauki.pl/articles/743561.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    induced-hereditary property of graphs
    additivity
    reducibility
    generating sets
    maximal graphs
    unique factorization
    Opis:
    A natural generalization of the fundamental graph vertex-colouring problem leads to the class of problems known as generalized or improper colourings. These problems can be very well described in the language of reducible (induced) hereditary properties of graphs. It turned out that a very useful tool for the unique determination of these properties are generating sets. In this paper we focus on the structure of specific generating sets which provide the base for the proof of The Unique Factorization Theorem for induced-hereditary properties of graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2002, 22, 1; 183-192
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    About uniquely colorable mixed hypertrees
    Autorzy:
    Niculitsa, Angela
    Voloshin, Vitaly
    Powiązania:
    https://bibliotekanauki.pl/articles/743697.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    colorings of graphs and hypergraphs
    mixed hypergraphs
    unique colorability
    trees
    hypertrees
    elimination ordering
    Opis:
    A mixed hypergraph is a triple = (X,,) where X is the vertex set and each of , is a family of subsets of X, the -edges and -edges, respectively. A k-coloring of is a mapping c: X → [k] such that each -edge has two vertices with the same color and each -edge has two vertices with distinct colors. = (X,,) is called a mixed hypertree if there exists a tree T = (X,) such that every -edge and every -edge induces a subtree of T. A mixed hypergraph is called uniquely colorable if it has precisely one coloring apart from permutations of colors. We give the characterization of uniquely colorable mixed hypertrees.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2000, 20, 1; 81-91
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Unique factorization theorem
    Autorzy:
    Mihók, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/743745.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    induced-hereditary
    additive property of graphs
    reducible property of graphs
    unique factorization
    uniquely partitionable graphs
    generating sets
    Opis:
    A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induced-hereditary and additive if it is closed under taking induced subgraphs and disjoint unions of graphs, respectively. Let ₁,₂, ...,ₙ be properties of graphs. A graph G is (₁,₂,...,ₙ)-partitionable (G has property ₁ º₂ º... ºₙ) if the vertex set V(G) of G can be partitioned into n sets V₁,V₂,..., Vₙ such that the subgraph $G[V_i]$ of G induced by V_i belongs to $_i$; i = 1,2,...,n. A property is said to be reducible if there exist properties ₁ and ₂ such that = ₁ º₂; otherwise the property is irreducible. We prove that every additive and induced-hereditary property is uniquely factorizable into irreducible factors. Moreover the unique factorization implies the existence of uniquely (₁,₂, ...,ₙ)-partitionable graphs for any irreducible properties ₁,₂, ...,ₙ.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2000, 20, 1; 143-154
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Maximum Edge-Colorings Of Graphs
    Autorzy:
    Jendrol’, Stanislav
    Vrbjarová, Michaela
    Powiązania:
    https://bibliotekanauki.pl/articles/31341153.pdf
    Data publikacji:
    2016-02-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    edge-coloring
    r -maximum k -edge-coloring
    unique-maximum edge-coloring
    weak-odd edge-coloring
    weak-even edge-coloring
    Opis:
    An $r$-maximum $k$-edge-coloring of $G$ is a $k$-edge-coloring of $G$ having a property that for every vertex $v$ of degree $d_G(v) = d, d \ge r$, the maximum color, that is present at vertex $v$, occurs at $v$ exactly $r$ times. The $r$-maximum index $ \chi_r^′ (G) $ is defined to be the minimum number $k$ of colors needed for an $r$-maximum $k$-edge-coloring of graph $G$. In this paper we show that $ \chi_r^′ (G) \le 3 $ for any nontrivial connected graph $G$ and $ r = 1$ or 2. The bound 3 is tight. All graphs $G$ with $ \chi_1^' (G) =i $, $i = 1, 2, 3$ are characterized. The precise value of the $r$-maximum index, $ r \ge 1 $, is determined for trees and complete graphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2016, 36, 1; 117-125
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-13 z 13

      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