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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Reconstructing Surface Triangulations by Their Intersection Matrices
    Autorzy:
    Arocha, Jorge L.
    Bracho, Javier
    García-Colín, Natalia
    Hubard, Isabel
    Powiązania:
    https://bibliotekanauki.pl/articles/31339343.pdf
    Data publikacji:
    2015-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    triangulated surface
    isomorphism
    intersection matrix
    Opis:
    The intersection matrix of a simplicial complex has entries equal to the rank of the intersecction of its facets. We prove that this matrix is enough to define up to isomorphism a triangulation of a surface.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2015, 35, 3; 483-491
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Determining Graphs by the Complementary Spectrum
    Autorzy:
    Pinheiro, Lucélia K.
    Souza, Bruna S.
    Trevisan, Vilmar
    Powiązania:
    https://bibliotekanauki.pl/articles/31562123.pdf
    Data publikacji:
    2020-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    graphs
    complementary eigenvalues
    graph isomorphism
    Opis:
    The complementary spectrum of a connected graph G is the set of the complementary eigenvalues of the adjacency matrix of G. In this note, we discuss the possibility of representing G using this spectrum. On one hand, we give evidence that this spectrum distinguishes more graphs than other standard graph spectra. On the other hand, we show that it is hard to compute the complementary spectrum. In particular, we see that computing the complementary spectrum is equivalent to finding all connected induced subgraphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 2; 607-620
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Isomorphic components of Kronecker product of bipartite graphs
    Autorzy:
    Jha, Pranava
    Klavžar, Sandi
    Zmazek, Blaž
    Powiązania:
    https://bibliotekanauki.pl/articles/971945.pdf
    Data publikacji:
    1997
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Kronecker product
    bipartite graphs
    graph isomorphism
    Opis:
    Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.
    Źródło:
    Discussiones Mathematicae Graph Theory; 1997, 17, 2; 301-309
    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ł:
    Digraphs with isomorphic underlying and domination graphs: connected $UG^c(d)$
    Autorzy:
    Factor, Kim
    Langley, Larry
    Powiązania:
    https://bibliotekanauki.pl/articles/743665.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    domination graph
    domination
    graph isomorphism
    underlying graph
    Opis:
    The domination graph of a directed graph has an edge between vertices x and y provided either (x,z) or (y,z) is an arc for every vertex z distinct from x and y. We consider directed graphs D for which the domination graph of D is isomorphic to the underlying graph of D. We demonstrate that the complement of the underlying graph must have k connected components isomorphic to complete graphs, paths, or cycles. A complete characterization of directed graphs where k = 1 is presented.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2007, 27, 1; 51-67
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Binary relations on the monoid of V-proper hypersubstitutions
    Autorzy:
    Denecke, Klaus
    Srithus, Rattana
    Powiązania:
    https://bibliotekanauki.pl/articles/729137.pdf
    Data publikacji:
    2006
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    solid variety
    degree of proper hypersubstitutions
    isomorphism degree of proper hypersubstitutions
    Opis:
    In this paper we consider different relations on the set P(V) of all proper hypersubstitutions with respect to a given variety V and their properties. Using these relations we introduce the cardinalities of the corresponding quotient sets as degrees and determine the properties of solid varieties having given degrees. Finally, for all varieties of bands we determine their degrees.
    Źródło:
    Discussiones Mathematicae - General Algebra and Applications; 2006, 26, 2; 233-251
    1509-9415
    Pojawia się w:
    Discussiones Mathematicae - General Algebra and Applications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Statistical Modelling: Application to the financial sector
    Autorzy:
    Roçadas, Cláudia
    Oliveira, Teresa
    Mexia, João
    Powiązania:
    https://bibliotekanauki.pl/articles/729944.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    populations with periodic reclassification
    likelihood ratio tests
    Markov chains
    isomorphism
    Opis:
    Our research is centred on the stochastic structure of matched open populations, subjected to periodical reclassifications. These populations are divided into sub-populations. In our application we considered two populations of customers of a bank: with and without account manager. Two or more of such population are matched when there is a 1-1 correspondence between their sub-populations and the elements of one of them can go to another, if and only if the same occurs with elements from the corresponding sub-populations of the other. So we have inputs and outputs of elements in the population and along with several sub-populations in which the elements can be placed. It is thus natural to use Markov chains to model these populations.
    Besides this study connected with Markov chains we show how to carry out Analysis of Variance - like analysis of entries and departures to and from de populations of customers. Our purpose is to study the flows in and out of customers in classes for the two populations and to make research on the influence of the factors year, class and region. We used the Likelihood ratio tests for the hypotheses formulated on the basis of these factors. In our work we verified that major hypotheses were all rejected. This raises the question of what are the effects and interactions truly relevant. Looking for an answer to this problem, we present the first partition to a change in the log Likelihood. This partition is very similar to the analysis of variance for the crossing of the factors that allowed us to use algebraic established results, see Fonseca et al. (2003, 2006), for models with balanced cross.
    Źródło:
    Discussiones Mathematicae Probability and Statistics; 2011, 31, 1-2; 103-119
    1509-9423
    Pojawia się w:
    Discussiones Mathematicae Probability and Statistics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Edge-Transitivity of Cayley Graphs Generated by Transpositions
    Autorzy:
    Ganesan, Ashwin
    Powiązania:
    https://bibliotekanauki.pl/articles/31340468.pdf
    Data publikacji:
    2016-11-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    Cayley graphs
    transpositions
    automorphisms of graphs
    edge-transitive graphs
    line graphs
    Whitney’s isomorphism theorem
    Opis:
    Let S be a set of transpositions generating the symmetric group Sn (n ≥ 5). The transposition graph of S is defined to be the graph with vertex set {1, . . ., n}, and with vertices i and j being adjacent in T(S) whenever (i, j) ∈ S. In the present note, it is proved that two transposition graphs are isomorphic if and only if the corresponding two Cayley graphs are isomorphic. It is also proved that the transposition graph T(S) is edge-transitive if and only if the Cayley graph Cay(Sn, S) is edge-transitive.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2016, 36, 4; 1035-1042
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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