Filtry
wszystkich: 926
-
Katalog
Wyniki wyszukiwania dla: GRAPH
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublikacjaA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
The Influence of Hybridization of Epoxy–Glass Laminates Modified with Metal Oxides and Graphite Particles
Publikacja -
Li nucleation on the graphite anode under potential control in Li-ion batteries
PublikacjaApplication of Li-ion batteries in electric vehicles requires improved safety, increased lifetime and high charging rates. One of the most commonly used intercalation anode material for Li-ion batteries, graphite, is vulnerable to Li nucleation, a side reaction which competes with the intercalation process and leads to loss of reversible capacity of the battery, ageing and short-circuits. In this study, we deploy a combined grand...
-
Graphitic Carbon Nitride and Titanium Dioxide Modified with 1 D and 2 D Carbon Structures for Photocatalysis
Publikacja -
Mesoporous carbon/graphitic carbon nitride spheres for photocatalytic H2 evolution under solar light irradiation
Publikacja -
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
On the super domination number of lexicographic product graphs
PublikacjaThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
Synchronous black hole search in directed graphs
PublikacjaThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Total Domination Versus Domination in Cubic Graphs
PublikacjaA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Reduced Graphene Oxide Joins Graphene Oxide To Teach Undergraduate Students Core Chemistry and Nanotechnology Concepts
PublikacjaNovel carbon nanomaterials such as reduced graphene oxide (rGO) and graphene oxide (GO) can be easily incorporated into the undergraduate curriculum to discuss basic chemistry and nanotechnology concepts. This paper describes a laboratory experiment designed to study the differences between GO and rGO regarding their physico-chemical properties (e.g. color, hydrophobicity, type of functional groups, electrical conductivity etc.)....
-
Graphene and Its Derivatives for Energy Storage
Publikacja -
Electronic Circuits for Graphene-Based Biosensor
Publikacja -
Graphene-based materials for capacitive deionization
Publikacja -
Graphene Production and Biomedical Applications: A Review
PublikacjaGraphene is a two-dimensional nanomaterial composed of carbon atoms with sp2 hybrid orbitals. Both graphene and graphene-based composite have gained broad interest among researchers because of their outstanding physiochemical, mechanical, and biological properties. Graphene production techniques are divided into top-down and bottom-up synthesis methods, of which chemical vapor deposition (CVD) is the most popular. The biomedical...
-
3D Model Preparing Patterns for Interactive Urban Visualization - Guidelines for Graphic Designers Preparing 3D Models for Virtual Reality Applications
PublikacjaWhile working on architectural visualizations, the software developer often has to work with graphic designers who create models in a different environment what can cause many complications. For this reason, it is very important to have some guidelines which can protect both the developer and the designer from commixing mistakes. The paper presents a list of such guidelines based on the authors’ experience. The reader can treat...
-
COMPUTERIZED MEDICAL IMAGING AND GRAPHICS
Czasopisma -
International Journal of Image and Graphics
Czasopisma -
Engineering Design Graphics Journal
Czasopisma -
Modeling and analysis of the effectiveness of the guard systemswith dynamic graphs
PublikacjaIn the following paper it will be presented a new model for analysis (in polynomial time) of the effectiveness of the guard systems. Therewill be presented its practical applications in problems such as searching for the weakest points of the system, planning guards' paths or cameras deployment, switching image from multiple cameras on several monitors, or interception of the intruder. This model is based on describing the guarded...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublikacjaWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...
-
The scanning tunnelling micrographs of highly oriented pyrolytic graphite
Dane BadawczeThe dataset contains the results imaging of a sample of highly oriented pyrolytic graphite obtained using scanning tunneling microscopy. The above variant of scanning probe microscopy is one of the most convenient research techniques at atomic scales. The file contains images corresponding to increasing magnifications from the 1 um scale to a few nanometers....
-
Graphs with isolation number equal to one third of the order
PublikacjaA 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...
-
Graphene Oxide as Mine of Knowledge: Using Graphene Oxide To Teach Undergraduate Students Core Chemistry and Nanotechnology Concepts
PublikacjaThe aim of this laboratory experiment is to utilize graphene oxide (GO) material to introduce under-graduate students to many well-known concepts of general chemistry. GO is a new nanomaterial that has generated worldwide interest and can be easily produced in every well-equipped undergraduate chemical laboratory. An in-depth examination of GO synthesis, as well as a study of its structure and properties, allows students to familiarize...
-
Graphitic Carbon Nitride Doped with the s-Block Metals: Adsorbent for the Removal of Methyl Blue and Copper(II) Ions
Publikacja -
Paired domination versus domination and packing number in graphs
PublikacjaGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Determination of the Diffusion Coefficient of Lithium Ions in Graphite Coated with Polymer-Derived SiCN Ceramic
PublikacjaPraca dotyczy wyznaczenia wsółczynnik adyfuzji jonów litu w materiale elektrodowym składającym się z grafitu pokrytego materiałem ceramicznym krzemo-azotkiem węgla (SiCN). Wartość współczynnika dyfuzji zmierzono elektrochemicznie technikami: woltamperometrii cyklicznej (CV), elektrochemicznej spektrodkopii impedancyjnej (EIS) oraz miareczkowania galwanostatycznego (GITT). Materiał otrzymano na drodze pirolizy mieszaniny grafit:polimer...
-
Fabrication of exfoliated graphite reinforced silicone rubber composites - Mechanical, tribological and dielectric properties
PublikacjaThe effect of exfoliated graphite (EG) on the mechanical, tribological and dielectric properties of the silicone rubber (QM) composites has been systematically investigated and analysed. Morphological analysis of the composites helps to understand the interfacial interaction between the filler and the rubber matrix as well as wear mechanism respectively. An enhancement in the mechanical, tribological and dielectric properties was...
-
Fabrication of exfoliated graphite reinforced silicone rubber composites - Mechanical, tribological and dielectric properties
PublikacjaThe effect of exfoliated graphite (EG) on the mechanical, tribological and dielectric properties of the silicone rubber (QM) composites has been systematically investigated and analysed. Morphological analysis of the composites helps to understand the interfacial interaction between the filler and the rubber matrix as well as wear mechanism respectively. An enhancement in the mechanical, tribological and dielectric properties was...
-
Cholesky factorization of matrices in parallel and ranking of graphs.
PublikacjaUporządkowane kolorowanie znajduje zastosowanie przy równoległej faktoryzacji macierzy metodą Cholesky'ego. Praca zawiera opis tego zastosowania. Podano także algorytmy optymalnego uporządkowanego kolorowania krawędzi pewnych klas grafów: grafów pełnych dwudzielnych oraz powstałych z pełnych dwudzielnych przez usunięcie O(log n) krawędzi.
-
Sum coloring of bipartite graphs with bounded degree.
PublikacjaArtykuł poświęcony jest złożoności obliczeniowej zagadnienia sumacyjnego kolorowania grafów dwudzielnych o ograniczonym stopniu. Zawiera dowód tego, że sumacyjne kolorowanie grafów dwudzielnych stopnia mniejszego równego 5 jest NP-zupełne oraz opis wielomianowego algorytmu, który optymalnie sumacyjnie koloruje grafy dwudzielne podkubiczne.
-
Graphs with convex domination number close to their order
PublikacjaW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
Self-stabilizing algorithm for edge-coloring of graphs
PublikacjaReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Sum Coloring of Bipartite Graphs with Bounded Degree
Publikacja -
program verification strategy and edge ranking of graphs
PublikacjaW artykule rozważamy model, w którym zakładamy, że dany jest zbiór asercji/testów dla pewnych bloków programu. Celem jest znalezienie optymalnej, tzn. wymagającej wykonania minimalnej liczby testów strategii wyszukiwania błędu w kodzie programu. Pomimo założenia w modelu, iż program posiada dokładnie jeden błąd, rozważania można uogólnić na testowanie kodu z dowolną liczbą błędów. Analizujemy teoretyczne własności tego modelu oraz...
-
Strong weakly connected domination subdivisible graphs
PublikacjaArtykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.
-
Parallel query processing and edge ranking of graphs
PublikacjaArtykuł poświęcony jest problemowi szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym. Jednym z zastosowań jest poszukiwanie optymalnych harmonogramów w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie funkcji dobroci przybliżonego algorytmu autorstwa Makino, Uno i Ibaraki wraz z rezultatami testów komputerowych przeprowadzonych dla grafów losowych.
-
Towards Increasing Density of Relations in Category Graphs
PublikacjaIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Graphs hard-to-process for greedy algorithm MIN
PublikacjaWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublikacjaW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
The maximum edge-disjoint paths problem in complete graphs
PublikacjaRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublikacjaThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
Facile synthesis and characterization of graphene and N-doped graphene by CVD method from liquid precursors for promising electrode materials
PublikacjaIn this study, high-quality and few-layered graphene was synthesized using the chemical vapor deposition (CVD) method from liquid sources. Two different liquid carbon sources, pyridine, and benzene, were used and deposited on nickel foam under heat conditions using a bubbler in a quartz tube. X-ray diffraction (XRD) and Raman analysis confirmed the crystalline properties of graphene and N-doped graphene, demonstrating the high...
-
Elastic polyurethane foams containing graphene nanoplatelets
PublikacjaElastic polyurethane foams were produced from two-component polyurethane systems (SPECFLEX NE 113 izocyjanian/NR 816 poliol system—SPC and Elastic MBMarket company system POLYOL ET MB 500/ISO ET MB 800—ET) by using a one-step method. The foams were a graphene nanoplatelets (GNP) in the amount ranging from 1 to 2 wt.%. The effect of the nanofiller on polyurethane matrix was determined by analyzing the chemical structure, static...
-
GRAPHENE-BASED SUPERCAPACITORS APPLICATION FOR ENERGY STORAGE
PublikacjaRecent advances in graphene-based supercapacitor technology for energy storage application were summarized. The comparison of different types of electrode materials in such supercapacitors was performed. The supercapacitors with graphene-based electrodes exhibit outstanding performance: high charge-discharge rate, high power density, high energy density and long cycle-life, what makes them suitable for various applications, e.g....