Publikacje - Katalog Publikacji - MOST Wiedzy

Wyszukiwarka

Katalog Publikacji

Filtry

wszystkich: 944

  • Kategoria

  • Rok

  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Katalog Publikacji

Rok 2006

Rok 2022

Rok 2008

Rok 2021

Rok 2012

Rok 2013

  • Grand Challenges on the Theory of Modeling and Simulation
    Publikacja
    • S. J. E. Taylor
    • A. Khan
    • K. L. Morse
    • A. Tolk
    • L. Yilmaz
    • J. Zander

    - Rok 2013

    Modeling & Simulation (M&S) is used in many different fields and has made many significant contributions. As a field in its own right, there have been many advances in methodologies and technologies. In 2002 a workshop was held in Dagstuhl, Germany, to reflect on the grand challenges facing M&S. Ten years on, a series of M& S Grand Challenge activities are marking a decade of progress and are providing an opportunity to reflect...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • GRAPHENE IN GAS CHEMIRESISTORS
    Publikacja

    Graphene has a range of unique physical properties which could be exploited in gas sensing. Every atom of graphene may be considered as a surface atom, able to interact even with single molecule of the target gas or vapour species resulting in the ultrasensitive sensor response. In this paper the potential of graphene as a nanomaterial for fabricating chemiresistors was described. Recent development in graphene sensors was considered...

  • Graphene oxide functionalized with methylene blue and its performance in singlet oxygen generation
    Publikacja
    • M. Wojtoniszak
    • D. Rogińska
    • B. Machaliński
    • M. Drozdzik
    • E. Mijowska
    • E. Mijowska

    - Materials Research Bulletin - Rok 2013

    Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2015

Rok 2010

Rok 2024

  • Granulometric characterization of Arctic driftwood sawdust from frame sawing process
    Publikacja

    - INDUSTRIAL CROPS AND PRODUCTS - Rok 2024

    Arctic driftwood can be used as an alternative source of wood as construction timber and furniture material, especially in Iceland and Greenland. The use of Arctic driftwood can help in the fight against climate change, by developing land reforestation processes and reducing the volume harvested wood from forests and sustainability of harvesting processes. In this paper the results of an analysis of the effect of long-term residence...

    Pełny tekst do pobrania w portalu

  • Graphs with isolation number equal to one third of the order
    Publikacja

    - DISCRETE MATHEMATICS - Rok 2024

    A set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...

    Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2005

Rok 2020

  • Graph classes generated by Mycielskians
    Publikacja

    - Discussiones Mathematicae Graph Theory - Rok 2020

    In this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...

    Pełny tekst do pobrania w portalu

Rok 2009

  • Graph decomposition for improving memoryless periodic exploration
    Publikacja

    - Rok 2009

    W ostatnich latach często badanym problem jest eksploracja anonimowych grafów z lokalnymi etykietami portów przy każdym wierzchołku. Niedawno pokazano [Czyzowicz et al., Proc. SIROCCO'09], że dla każdego grafu istnieje poetykietowanie prowadzące do eksploracji przez automat bezpamięciowy z okresem co najwyżej 13n/3. W niniejszej pracy poprawiamy to ograniczenie do 4n-2, stosując całkowicie nową technikę dekompozycji grafu.

    Pełny tekst do pobrania w serwisie zewnętrznym

Rok 2007

Rok 2023

Rok 2017

Rok 2016

Rok 2018

Rok 2019

Rok 2011

Podział alfabetyczny