Informacja

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

Wyszukujesz frazę "complement" wg kryterium: Temat


Tytuł:
Zastosowanie grafu niezgodności i dopełnień w procesie kodowania automatów asynchronicznych
An application of the Incompatibility and Complement Graph to asynchronous FSM coding
Autorzy:
Kania, D.
Kulisz, J.
Powiązania:
https://bibliotekanauki.pl/articles/156212.pdf
Data publikacji:
2008
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
problem pokrycia i dopełnienia
teoria grafów
kodowanie stanów
sekwencyjne układy asynchroniczne
covering and complement problem
graph theory
state assignment
asynchronous FSMs
Opis:
W artykule przedstawiono przykład zastosowania nowego rodzaj grafu - grafu niezgodności i dopełnień. Specyficzną cechą tego grafu jest to, że zawiera on dwa rodzaje krawędzi: krawędzie skojarzone z relacjami niezgodności oraz krawędzie skojarzone z relacjami dopełniania. Graf może być wykorzystywany w szeregu problemów optymalizacyjnych, w których rozważane są relacje niegodności i dopełniania wzorców bitowych. W artykule zaprezentowano wykorzystanie grafu w procesie kodowania stanów asynchronicznych układów sekwencyjnych. Przedstawiono też odpowiednie algorytmy tworzenia grafu i kolorowania jego wierzchołków.
The paper presents an application of a novel concept of graph - the Incompatibility and Complement Graph. A specific feature of the graph is that it contains two kinds of edges: connecting mutually incompatible nodes, and connecting mutually complementing nodes [3, 4]. The graph can be useful in certain class of optimization problems, in which compatibility of bit patterns in both the true and the complemented form has to be analyzed [5]. An example of such a problem is covering analysis in asynchronous FSM coding. The relevant coding method was presented by Tracey [1]. The method consists of several steps. In one of the steps a Boolean matrix is built, describing partitions of the relevant state set, which are required to provide coding free form critical races. In the subsequent step the Boolean matrix has to be reduced. During this step compatibility of the matrix rows both in the true, and the complemented form has to be analysed. For this purpose the Row Incompatibility and Complement graph can be used. The paper presents a simple example explaining the method. Appropriate algorithms for the graph building (Fig. 3) and colouring (Fig. 4) are also presented.
Źródło:
Pomiary Automatyka Kontrola; 2008, R. 54, nr 8, 8; 486-488
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wstępne badania nad niektórymi odczynami serologicznymi u królików oparzonych napalmem, leczonych hiperbarią tlenową
Initial tests on selected serological reactions in rabbits burnt with napalm and subjected to hyperbaric oxygenation
Autorzy:
Ulewicz, K.
Michniewski, P.
Kierznikowicz, B.
Łokucijewski, B.
Stencel, J.
Powiązania:
https://bibliotekanauki.pl/articles/1360338.pdf
Data publikacji:
2015
Wydawca:
Polskie Towarzystwo Medycyny i Techniki Hiperbarycznej
Tematy:
metoda leczenia hiperbarią tlenową
odczyn aktywności dopełniacza
odczyn hemaglutynacji
badania histopatologiczne ran oparzeniowych
hyperbaric oxygenation therapy
complement activity reaction
haemagglutination reaction
burn wound histopathology
Opis:
Metoda leczenia hiperbarią tlenową znajduje zastosowanie także w terapii różnego pochodzenia oparzeń. W przedstawionej pracy zastosowano tę metodę, w leczeniu oparzeń napalmem zwierząt doświadczalnych. Badaczy interesowały reakcje immunologiczne zachodzące w organizmach zwierząt, a także wpływ tej metody terapeutycznej na proces leczenia oparzenia. Dwie grupy znieczulonych ewipanem królików, wcześniej uodpornionych bakteriami S. typhi, poparzono napalmem. Grupę badaną poddano serii zabiegów leczniczych 100% tlenem przy ciśnieniu 2 atm, w grupie kontrolnej nie zastosowano tej metody. U wszystkich zwierząt wykonywano 6- krotne badania aktywności dopełniacza metodą 50% hemolizy, oraz odczyn hemaglutynacji z antygenami O i H S.typhi typ F7. W celu kontroli procesu leczniczego przeprowadzono również szereg badań histopatologicznych ran oparzeniowych w obydwu grupach królików. W przeprowadzonych badaniach zaobserwowano wzrost aktywności dopełniacza u wszystkich badanych zwierząt, przy czym w grupie badanej wzrost nastąpił później. Badania histopatologiczne potwierdziły wydatniejszy proces gojenia ran w grupie leczonej metodą hiperbarii tlenowej.
Hyperbaric oxygenation therapy has found its application in the treatment of various types of burns. The presented work describes the use of this method in treating napalm burns in experimental animals. The researchers took particular interest in the immunological reactions occurring in animals, as well as the effect of the said therapy on the healing process. Two groups of rabbits, previously anaesthetised with Evipan and immunised with S. typhi phage F7 microorganisms, were burnt with the use of napalm. The tested group was subjected to a series of treatment sessions with 100% oxygen at the pressure of 2 atm, whereas the control group did not undergo such treatment. Six repeated tests on complement activity with 50% haemolysis method and heamagglutination reaction quantification with antigens O and H S.typhi phage F7 were carried out on all of the researched animals. Moreover, for the purpose of control of the healing process, a number of histopathological exams on the burn wounds were conducted in both groups of rabbits. The research showed an increase in complement activity in all tested animals; however, in the tested group it occurred later. Histopathological tests confirmed a more advanced healing process in the group subjected to hyperbaric oxygenation.
Źródło:
Polish Hyperbaric Research; 2015, 1(50); 55-60
1734-7009
2084-0535
Pojawia się w:
Polish Hyperbaric Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Validation of a flow cytometry-based assay for monitoring complement-dependent cytotoxicity of an anti-CD20 biosimilar candidate antibody
Autorzy:
Blanco-Santana, R.
Cedeno-Arias, M.
Garcia-Perez, Z.
Columbie-Gilbert, D.
Portillo-Vaquer, A.
Rengifo-Calzado, E.
Powiązania:
https://bibliotekanauki.pl/articles/80888.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow cytometry
validation
complement-dependent cytotoxicity
monoclonal antibody
CD20 antigen
biological activity
Źródło:
BioTechnologia. Journal of Biotechnology Computational Biology and Bionanotechnology; 2014, 95, 1
0860-7796
Pojawia się w:
BioTechnologia. Journal of Biotechnology Computational Biology and Bionanotechnology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Uzupełnienia do Kroniki życia i twórczości Ignacego Krasickiego
Addenda to The Chronicle of Ignacy Krasickis Life and Literary Output
Autorzy:
Stasiewicz, Krystyna
Powiązania:
https://bibliotekanauki.pl/articles/1954671.pdf
Data publikacji:
2002
Wydawca:
Katolicki Uniwersytet Lubelski Jana Pawła II. Towarzystwo Naukowe KUL
Tematy:
recepcja XBW
utwory okolicznościowe
uzupełnienie Estreichera
sprostowanie
reception of XBW
occasional works
complement to Estreicher
correction
Opis:
Eighteenth century accidental publications found by the author are an addendum to the chronicle of Ignacy Krasicki's life and literary output published by Zdzisław Goliński in 1979. These literary trifles prove that Krasicki was a person highly valued and respected by his contemporaries. The documents are a new significant elements in correct reconstruction of the life of the author of Monachomachia, and especially of its fragments in the 1770's.
Źródło:
Roczniki Humanistyczne; 2002, 50, 1; 73-79
0035-7707
Pojawia się w:
Roczniki Humanistyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Transitory Categories And The Metalanguage Of Syntax
Autorzy:
Grochowski, Maciej
Powiązania:
https://bibliotekanauki.pl/articles/634625.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
metalanguage of syntax, transitory category, the Polish language, complement, adverbial
Opis:
The first part of the paper constitutes an analysis of the term “transitory category” as presented by Adam Heinz, and a justification of the view that there is a need to eliminate the term from the metalanguage of syntax. The second part of the paper is a reconstruction of the reasoning mechanism Adam Heinz developed in order to postulate the existence of a transitory category between the complement and the adverbial. The last part of the text shows an effective method of analysing relations between parts of the sentence without a necessity to use the term “transitory category”.
Źródło:
Studia Linguistica Universitatis Iagellonicae Cracoviensis; 2015, 132, 1
2083-4624
Pojawia się w:
Studia Linguistica Universitatis Iagellonicae Cracoviensis
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The least eigenvalue of the graphs whose complements are connected and have pendent paths
Autorzy:
Wang, C.
Yu, G.
Sun, W.
Cao, J.
Powiązania:
https://bibliotekanauki.pl/articles/91753.pdf
Data publikacji:
2018
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
graph
complement
pendent path
adjacency matrix
least eigenvalue
Opis:
The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices of the graph. Its minimum eigenvalue is defined as the least eigenvalue of the graph. Let Gn be the set of the graphs of order n, whose complements are connected and have pendent paths. This paper investigates the least eigenvalue of the graphs and characterizes the unique graph which has the minimum least eigenvalue in Gn.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 303-308
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Least Eigenvalue of Graphs whose Complements Are Unicyclic
Autorzy:
Wang, Yi
Fan, Yi-Zheng
Li, Xiao-Xin
Zhang, Fei-Fei
Powiązania:
https://bibliotekanauki.pl/articles/31339491.pdf
Data publikacji:
2015-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
unicyclic graph
complement
adjacency matrix
least eigen- value
Opis:
A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order $n$ and size $m$ in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size $ n/2 $). In this paper we discuss the minimizing graphs of a special class of graphs of order $n$ whose complements are connected and contains exactly one cycle (namely the class $ \mathcal{U}_n^c $ of graphs whose complements are unicyclic), and characterize the unique minimizing graph in $ \mathcal{U}_n^c $ when $ n \ge 20 $.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 249-260
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The ancestry and cumulative evolution of immune reactions
Autorzy:
Dzik, Jolanta
Powiązania:
https://bibliotekanauki.pl/articles/1040306.pdf
Data publikacji:
2010
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
signal transduction
invertebrates
receptors
cytokines
antigen presentation
nitric oxide
phagocytosis
evolution
innate immunity
complement
antibody-based immunity
superoxide
protoza
vertebrates
sponges
Opis:
The last two decades of study enriched greatly our knowledge of how the immune system originated and the sophisticated immune mechanisms of today's vertebrates and invertebrates developed. Even unicellular organisms possess mechanisms for pathogen destruction and self recognition. The ability to distinguish self from non-self is a prerequisite for recognition of sexual compatibility and ensuring survival. Molecules involved in these processes resemble those found in the phagocytic cells of higher organisms. Recognition of bacteria by scavenger receptors induces phagocytosis or endocytosis. The phagocytic mechanisms characterizing the amoeboid protozoans developed further during the evolution towards innate immunity. The scavenger receptor cysteine-rich domain SRCR is encoded in the genomes from the most primitive sponges to mammals. The immune system of sponges comprises signal transduction molecules which occur in higher metazoans as well. Sponges already possess recognition systems for pathogenic bacteria and fungi, based on membrane receptors (a lipopolysaccharide-interacting protein, a cell surface receptor recognizing β(1 → 3)-d-glucans of fungi). Perforin-like molecules and lysozymes are involved, among others, in defense in sponges. Reactive oxygen and nitrogen species function in the immunity of early metazoan. Genes encoding the family of reactive oxygen-generating NADPH oxidases (Noxes) are found in a variety of protists and plants. The NO synthases of cnidarians, mollusks, and chordates are conserved with respect to the mammalian NOS. The antimicrobial peptides of protozoans, amoebapores, are structural and functional analogs of the natural killer cell peptide, NK-lysin, of vertebrates. An ancestral S-type lectin has been found in sponges. Opsonizing properties of lectins and the ability to agglutinate cells justify their classification as primitive recognition molecules. Invertebrate cytokines are not homologous to those of vertebrate, and their functional convergence was presumably enabled by the general similarity of the lectin-like recognition domain three-dimensional structure. Sponges contain molecules with SCR/CCP domains that show high homology to the mammalian regulators of complement activation (RCA family). A multi-component complement system comprising at least the central molecule of the complement system, C3, Factor B, and MASP developed in the cnidarians and evolved into the multilevel cascade engaged in innate and acquired immunity of vertebrates. The adaptive immune system of mammals is also deeply rooted in the metazoan evolution. Some its precursors have been traced as deep as in sponges, namely, two classes of receptors that comprise Ig-like domains, the receptor tyrosine kinases (RTK), and the non-enzymic sponge adhesion molecules (SAM). The antibody-based immune system defined by the presence of the major histocompatibility complex (MHC), T-cell receptor (TCR), B-cell receptor (BCR) or recombination activating genes (RAGs) is known beginning from jawed fishes. However, genes closely resembling RAG1 and RAG2 have been uncovered in the genome of a see urchin. The ancestry of MHC gene remains unknown. Similarly, no homologue of the protein binding domain (PBD) in MHC molecules has been found in invertebrates. The pathway by which endogenous peptides are degraded for presentation with class I MHC molecules utilizes mechanisms similar to those involved in the normal turnover of intracellular proteins, apparently recruited to work also for the immune system. Several cDNAs coding for lysosomal enzymes, e.g., cathepsin, have been isolated from sponges. All chromosomal duplication events in the MHC region occurred after the origin of the agnathans but before the gnathostomes split from them. The V-domains of the subtype found in the receptors of T and B-cells are known from both agnathans and cephalochordates, although they do not rearrange. The rearrangement mechanism of the lymphocyte V-domains suggests its origin from a common ancestral domain existing before the divergence of the extant gnathostome classes. Activation-induced deaminase (AID) - homologous proteins have been found only in the gnathostomes. It appears thus that the adaptive immunity of vertebrates is a result of stepwise accumulation of small changes in molecules, cells and organs over almost half a billion years.
Źródło:
Acta Biochimica Polonica; 2010, 57, 4; 443-466
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Similarity measures for Atanassov’s intuitionistic fuzzy sets : some dilemmas and challenges
Autorzy:
Szmidt, Eulalia
Kacprzyk, Janusz
Bujnowski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/2183493.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
similarity measures
Atanassov’s intuitionistic fuzzy sets
distances
complement
Opis:
We discuss some aspects of similarity measures in the context of Atanassov’s intuitionistic fuzzy sets (IFSs, for short). IFSs, proposed in 1983, are a relatively new tool for the modeling and simulation and, because of their construction, present us with new challenges as far the similarity measures are concerned. Specifically, we claim that the distances alone are not a proper measure of similarity for the IFSs. We stress the role of a lack of knowledge concerning elements (options, decisions, etc.) and point out the role of the opposing (complementing) elements. We also pay attention to the fact that it is not justified to talk about similarity when one has not enough knowledge about the compared objects/elements. Some novel measures of similarity are presented.
Źródło:
Control and Cybernetics; 2022, 51, 2; 249--266
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
RNS/TCS converter design using high-level synthesis in FPGA
Wysokopoziomowa synteza konwertera RNS/U2 w FPGA
Autorzy:
Smyk, R.
Czyżak, M.
Powiązania:
https://bibliotekanauki.pl/articles/269200.pdf
Data publikacji:
2017
Wydawca:
Politechnika Gdańska. Wydział Elektrotechniki i Automatyki
Tematy:
Residue Number System
RNS
two's-complement system
TCS
Chinese Remainder Theorem I
CRT I
FPGA
system resztowy
system z uzupełnieniem do 2
U2
konwerter RNS/U2
chińskie twierdzenie o resztach
Opis:
An experimental high-level synthesis (HLS) of the residue number system (RNS) to two’s-complement system (TCS) converter in the Vivado Xilinx FPGA environment is shown. The assumed approach makes use of the Chinese Remainder Theorem I (CRT I). The HLS simplifies and accelerates the design and implementation process, moreover the HLS synthesized architecture requires less hardware by about 20% but the operational frequency is smaller by 30% than that for the VHDL designed converter.
W pracy przedstawiono eksperymentalną wysokopoziomową syntezę w FPGA konwertera L systemu resztowego do systemu reprezentacji z uzupełnieniem do 2 (U2). W zastosowanym podejściu wykorzystano algorytm konwersji na bazie chińskiego twierdzenia o resztach (CRT 1), Zauważono, że synteza wysokopoziomowa ułatwia proces projektowania oraz zauważalnie skraca czas testowania układu. Zaprojektowana architektura konwertera przy wykorzystaniu syntezy wysokopoziomowej pochłania o około 20% zasobów układu FPGA mniej niż dla konwertera zaprojektowanego przy użyciu języka VHDL, jednak maksymalna częstotliwość pracy jest niższa o około 30%.
Źródło:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2017, 57; 121-126
1425-5766
2353-1290
Pojawia się w:
Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Restrained Domination in Self-Complementary Graphs
Autorzy:
Desormeaux, Wyatt J.
Haynes, Teresa W.
Henning, Michael A.
Powiązania:
https://bibliotekanauki.pl/articles/32083901.pdf
Data publikacji:
2021-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
domination
complement
restrained domination
self-complementary graph
Opis:
A self-complementary graph is a graph isomorphic to its complement. A set S of vertices in a graph G is a restrained dominating set if every vertex in V(G) \ S is adjacent to a vertex in S and to a vertex in V(G) \ S. The restrained domination number of a graph G is the minimum cardinality of a restrained dominating set of G. In this paper, we study restrained domination in self-complementary graphs. In particular, we characterize the self-complementary graphs having equal domination and restrained domination numbers.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 2; 633-645
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Protein C-mannosylation: Facts and questions.
Autorzy:
Furmanek, Aleksandra
Hofsteenge, Jan
Powiązania:
https://bibliotekanauki.pl/articles/1044326.pdf
Data publikacji:
2000
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
RNase
complement
C-mannosylation
Opis:
Among the posttranslational modifications of proteins, glycosylation is probably the most abundant one. Two main types of protein glycosylation have been known for several years, namely N-glycosylation and O-glycosylation. Their biochemical properties, structure and biosynthesis, have been described extensively. Their biological functions are also known for a number of proteins, although in many cases the function remains speculative despite continuous efforts. A few years ago, a new type of protein glycosylation was found, which is different from the above-mentioned ones. It was called C-glycosylation, since the sugar is linked to the protein through a carbon-carbon bond. This article reviews the biochemistry of C-glycosylation, the biosynthetic pathway and structural requirements. Possible biological functions of this modification are also discussed.
Źródło:
Acta Biochimica Polonica; 2000, 47, 3; 781-789
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Trees as Star Complements in Regular Graphs
Autorzy:
Rowlinson, Peter
Powiązania:
https://bibliotekanauki.pl/articles/31562766.pdf
Data publikacji:
2020-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
eigenvalue
regular graph
star complement
tree
Opis:
Let G be a connected r-regular graph (r > 3) of order n with a tree of order t as a star complement for an eigenvalue µ ∉ {−1, 0}. It is shown that n ≤ 1/2 (r + 1)t − 2. Equality holds when G is the complement of the Clebsch graph (with µ = 1, r = 5, t = 6, n = 16).
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 2; 621-636
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the validity of the definition of a complement-classifier
Autorzy:
Stopa, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/1047622.pdf
Data publikacji:
2020-12-29
Wydawca:
Copernicus Center Press
Tematy:
category theory
topos theory
categorical logic
Heyting algebras
co-Heyting algebras
intuitionistic logic
dual to intuitionistic logic
complement-classifier
Opis:
It is well-established that topos theory is inherently connected with intuitionistic logic. In recent times several works appeared concerning so-called complement-toposes (co-toposes), which are allegedly connected to the dual to intuitionistic logic. In this paper I present this new notion, some of the motivations for it, and some of its consequences. Then, I argue that, assuming equivalence of certain two definitions of a topos, the concept of a complement-classifier (and thus of a co-topos as well) is, at least in general and within the conceptual framework of category theory, not appropriately defined. For this purpose, I first analyze the standard notion of a subobject classifier, show its connection with the representability of the functor Sub via the Yoneda lemma, recall some other properties of the internal structure of a topos and, based on these, I critically comment on the notion of a complement-classifier (and thus of a co-topos as well).
Źródło:
Zagadnienia Filozoficzne w Nauce; 2020, 69; 111-128
0867-8286
2451-0602
Pojawia się w:
Zagadnienia Filozoficzne w Nauce
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On graphs G for which both g and G̅ are claw-free
Autorzy:
Fujita, Shinya
Powiązania:
https://bibliotekanauki.pl/articles/744362.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
claw-free
complement
maximum degree
Opis:
Let G be a graph with |V(G)| ≥ 10. We prove that if both G and G̅ are claw-free, then min{Δ(G), Δ(G̅)} ≤ 2. As a generalization of this result in the case where |V(G)| is sufficiently large, we also prove that if both G and G̅ are $K_{1,t}$-free, then min{Δ(G),Δ(G̅)} ≤ r(t- 1,t)-1 where r(t-1,t) is the Ramsey number.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 267-272
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł

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