Filtry
wszystkich: 917
wybranych: 735
-
Katalog
Filtry wybranego katalogu
Wyniki wyszukiwania dla: GRAPH
-
Dynamic coloring of graphs
PublikacjaDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
2-bondage in graphs
PublikacjaA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Common Independence in Graphs
PublikacjaAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Optimizing the computation of a parallel 3D finite difference algorithm for graphics processing units
PublikacjaThis paper explores the possibilities of using a graphics processing unit for complex 3D finite difference computation via MUSTA‐FORCE and WENO algorithms. We propose a novel algorithm based on the new properties of CUDA surface memory optimized for 2D spatial locality and compare it with 3D stencil computations carried out via shared memory, which is currently considered to be the best approach. A case study was performed for...
-
Influence of chemically prepared H2SO4-graphite intercalation compound (GIC) precursor on parameters of exfoliated graphite (EG) for oil sorption from water
Publikacja -
Studies of Exfoliated Graphite (EG) for Heavy Oil Sorption
Publikacja -
Cement composites with expanded graphite as resistance heating elements
Publikacja -
Cement composites with expanded graphite/paraffin as storage heater
Publikacja -
Smart Graphite–Cement Composites with Low Percolation Threshold
Publikacja -
Electric and thermoelectric properties of cement composites with expanded graphite
Publikacja -
Mechanism of Li nucleation at graphite anodes and mitigation strategies
PublikacjaLithium metal plating is a critical safety issue in Li-ion cells with graphite anodes, and contributes significantly to ageing, drastically limiting the lifetime and inducing capacity loss. Nonetheless, the nucleation mechanism of metallic Li on graphite anodes is still poorly understood. But in-depth understanding is needed to rationally design mitigation measures. In this work, we conducted FirstPrinciples studies to elucidate...
-
Synthesis, dispersion, and cytocompatibility of graphene oxide and reduced graphene oxide
Publikacja -
Effect of graphene thickness on photocatalytic activity of TiO2-graphene nanocomposites
Publikacja -
Comparative Analysis of Regular Grid Based Algorithms in the Design of Graphical Control Panels
Publikacja -
Subjective Perception of the Background Color and Layout in the Design of Typical Graphical Control Panels
Publikacja -
The effects of graphical interface design characteristics on human–computer interaction task efficiency
Publikacja -
Extraordinary Adsorption of Methyl Blue onto Sodium-Doped Graphitic Carbon Nitride
Publikacja -
Adsorption performance of graphitic carbon nitride-based materials: Current state of the art
Publikacja -
Surface properties tuning of exfoliated graphitic carbon nitride for multiple photocatalytic performance
Publikacja -
Influence of Hydrogenation on Morphology, Chemical Structure and Photocatalytic Efficiency of Graphitic Carbon Nitride
Publikacja -
Photocatalytic activity of zinc oxide nanorods incorporated graphitic carbon nitride catalyst
PublikacjaBackground Photocatalysts are user-friendly and serve as compatible materials for degrading industrial dye pollutants. This study utilizes zinc oxide/graphitic carbon nitride (ZnO/g-C3N4) nanocomposites against degrading methylene blue (MB). Methods The hydrothermal method assisted sonication technique was used to fabricate the ZnO/g-C3N4 composite with varying ratios of ZnO/g-C3N4 (1:0.25, 1:0.50, 1:1). The synthesized materials...
-
CAVER Analyst 1.0: graphic tool for interactive visualization and analysis of tunnels and channels in protein structures
Publikacja -
On the deficiency of bipartite graphs
Publikacja -
Named Property Graphs
Publikacja -
Serialization for Property Graphs
Publikacja -
Rank Coloring of Graphs.
PublikacjaRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublikacjaRozdział poświęcony jest cyrkularnemu modelowi kolorowania krawędzi. Rozważana jest zarówno wersja wierzchołkowa i krawędziowa. Szczególny nacisk położono na złożoność obliczeniową i zastosowania dla omawianych modeli kolorowania.
-
T-coloring of graphs.
PublikacjaNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Harmonions Coloring of Graphs.
PublikacjaProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
Classical coloring of graphs.
PublikacjaRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublikacjaRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Non-isolating bondage in graphs
PublikacjaA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Computer graphics toos application for visualsation of measurements results of ship hull sections and blocks.
PublikacjaOpisano zakres minimalnych wymagań dla programu komputerowego, służącego do wizualizacji wyników pomiarów sekcji i bloków kadłuba okrętowego. Przedstawiono sposób przenoszenia danych z urządzenia pomiarowego do programu i pokazano przykłady pomiarów wykonanych na sekcjach zbudowanych w Stoczni Gdynia S.A.
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
GRAPHENE IN GAS CHEMIRESISTORS
PublikacjaGraphene 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...
-
Multifunctional cement composites with expanded graphite for temperature monitoring of buildings
Publikacja -
Tuning the work function of graphite nanoparticles via edge termination
PublikacjaGraphite nanoparticles are important in energy materials applications such as lithium-ion batteries (LIBs), supercapacitors and as catalyst supports. Tuning the work function of the nanoparticles allows local control of lithiation behaviour in LIBs, and the potential of zero charge of electrocatalysts and supercapacitors. Using large scale density functional theory (DFT) calculations, we find that the surface termination of multilayer...
-
Examining users’ preferences towards vertical graphical toolbars in simple search and point tasks
Publikacja -
Application of 3D graphic software and GIS in visual impact assessment of high-voltage overhead transmission lines
Publikacja -
Comparison of the Toxicity of Pristine Graphene and Graphene Oxide, Using Four Biological Models
Publikacja