Search results for: graph
-
Electrochemical Production of Sodium Hypochlorite from Salty Wastewater Using a Flow-by Porous Graphite Electrode
PublicationThe production of sodium hypochlorite (NaOCl) from salty wastewater using an electrochemical cell has several advantages over other methods that often require hazardous chemicals and generate toxic waste, being more sustainable and environmentally friendly. However, the process of producing sodium hypochlorite using an electrochemical cell requires careful control of the operating conditions, such as the current density, flow rate,...
-
Local Structure and Stability of SEI in Graphite and ZFO Electrodes Probed by As K-edge Absorption Spectroscopy
PublicationThe evolution of the solid electrolyte interphase (SEI) during the first Li uptake in advanced Li-ion electrodes is studied by X-ray absorption spectroscopy (XAS). The As atoms present in the electrolyte solution were used as a local probe for monitoring the SEI growth on different electrodes. High-quality As K-edge spectra were collected in fluorescence mode for a set of graphite and carbon-coated ZnFe2O4 electrodes. XAS measurements...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublicationThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
Modelling and analysis of beam/bar structure by application of bond graphs
PublicationThe paper presents an uniform, port-based approach to modelling of beam/bar systems (trusses). Port-based model of such distributed parameter system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The constructed computational package enables the frequency...
-
Archives of civil engineering. Intelligent graphic modeler integrating FE analisys of transient heat transfer with early computer-aided design of energy-efficient buildings
PublicationW pracy zaprezentowano nowatorski Modeler Rozmyty, w którym zaimplementowano unikalną koncepcję rozpoznawania. Modeler Rozmyty dokonuje ekstrakcji danych geometrycznych poprzez rozpoznanie i identyfikację niedokładnych i niejednorodnych rysunków, złożonych z prostych obiektów graficznych.
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Packing [1,Delta]-factors in graphs of small degree
PublicationRozważano problem znalezienia w grafie zadanej liczby k krawędziowo rozłącznych [1,Delta]-faktorów, gdzie Delta oznacza stopień grafu. Problem ten można rozwiązać w czasie liniowym dla k=2, jest on jednak NP-trudny dla każdego k>=3. Pokazano, że wariant minimalizacjny problemu dla k=2 jest NP-trudny dla grafów planarnych podkubicznych, jednak w ogólności istnieje algorytm (42 Delta - 30) / (35 Delta - 21) - aproksymacyjny.
-
Ramsey numbers for triangles versus almost-complete graphs.
PublicationPokazano, że w każdym krawędziowym pokolorowaniu dwoma kolorami grafu pełnego o 38 wierzchołkach występuje trójkąt w pierwszym kolorze lub podgraf izomorficzny z K_10 - e w drugim kolorze. Stąd otrzymujemy górne oszacowanie R(K_3, K_10 - e) <= 38. Przedstawiamy także pokolorowanie krawędziowe grafu K_36, którego istnienie dowodzi, że R(K_3, K_10 - e) >= 37.
-
Processing of musical metadata employing Pawlak's flow graphs.
PublicationW artykule przedstawiono problemy wyszukiwania informacji muzycznej. W eksperymentach posłużono się meta opisem oraz wykorzystano metodę grafów przepływowych Pawlaka. Opisano skonstruowaną bazę nagrań muzycznych. Słowa kluczowe: meta opis, wyszukiwanie informacji muzycznej, baza danych muzycznych
-
Music Archive Metadata Processing Based on Flow Graphs.
PublicationW referacie zaproponowano metodykę wyszukiwania informacji muzycznej w bazach internetowych w oparciu o meta opis. Skonstruowany algorytm wykorzystuje grafy przepływowe Pawlaka.
-
The complexity of the T-coloring problem for graphs with small degree.
PublicationW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
The complexity of the T-coloring problem for graphs with small degree
Publication -
Some results concerning the complexity of restricted colorings of graphs
Publication -
Edge-chromatic sum of trees and bounded cyclicity graphs
Publication -
Early detection of imminent threats in social relation graphs
PublicationWczesne wykrywanie zagrożeń i anomalii w sieciach społecznych jest dziś prawdziwym wyzwaniem. Ludzie w realnym świecie tworzą wiele złożonych relacji społecznych, które mogą być przedstawione za pomocą grafów, w których węzły reprezentują aktorów (pojedyncze osoby lub organizacje) a krawędzie wskazują na powiązania pomiędzy nimi. Analiza nieustannie zmieniających się relacji pomiędzy aktorami może wskazać konkretne nadciągające...
-
The circular chromatic index of some class 2 graphs
PublicationW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Easy and hard instances of arc ranking in directed graphs
PublicationArtykuł dotyczy uporządkowanego kolorowania łuków grafów skierowanych. Problem polega na takim przyporządkowaniu liczb łukom digrafu, aby każda skierowana ścieżka łącząca dwa łuki o tej samej liczbie (kolorze) zawierała łuk o kolorze wyższym. Praca podaje liniowy optymalny algorytm dla pewnego szczególnego przypadku, oraz zawiera dowód, iż problem ten jest obliczeniowo trudny dla 3-dzielnych acyklicznych digrafów i stałej liczby...
-
A note on compact and compact circular edge-colorings of graphs
PublicationW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
A note on the strength and minimum color sum of bipartite graphs
PublicationSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
The paired-domination and the upper paired-domination numbers of graphs
PublicationIn this paper we obtain the upper bound for the upper paired-domination number and we determine the extremal graphs achieving this bound. Moreover we determine the upper paired- domination number for cycles.
-
GRAPHICAL REPRESENTATION OF MUSIC SET BASED ON MOOD OF MUSIC. GRAFICZNA PREZENTACJA ZBIORU MUZYCZNEGO OPARTA NA ANOTACJI NASTROJU MUZYKI
PublicationOne of the features for music recommendation, which is useful and intuitive for music listen-ers, is “mood”. The paper presents an approach to graphical representation of mood of music pieces. Subjective evaluation based on listening tests is performed for assigning mood labels of 150 pieces of music and placing them on the 2D mood plane. As a result, a map of songs is created, where music excerpts with similar mood are organized...
-
Auto/bio/géo/graphies : les enjeux spatiaux de la mémoire dans les récits autobiographiques et testimoniaux du temps de la guerre chez Durocher, Langfus, Rawicz
Publication -
Comparison of How Graphite and Shungite Affect Thermal, Mechanical, and Dielectric Properties of Dielectric Elastomer-Based Composites
Publication -
Adsorption of cationic dyes onto Fe@graphite core–shell magnetic nanocomposite: Equilibrium, kinetics and thermodynamics
Publication -
Antibacterial properties of TiO2 modified with reduced graphene oxide
Publication -
Graphene field-effect transistor application for flow sensing
PublicationMicroflow sensors offer great potential for applications in microfluidics and lab-on-a-chip systems. However, thermal-based sensors, which are commonly used in modern flow sensing technology, are mainly made of materials with positive temperature coefficients (PTC) and suffer from a self-heating effect and slow response time. Therefore, the design of novel devices and careful selection of materials are required to improve the overall...
-
Rapid cardiac ischemia detection with an epicardial graphene probe
Publication -
Cellular uptake of biotransformed graphene oxide into lung cells
Publication -
Post-plasma oxidation in water of graphene paper surface
Publication -
Recent and Emerging Applications of Graphene-based metamaterials in Electromagnetics
PublicationSurface Plasmon Polaritons (SPPs) operating in mid-infrared up to terahertz (THz) frequencies have been traditionally manufactured on expensive metals such as gold, silver, etc. However, such metals have poor surface confinement that limits the optical applications of SPPs. The invention of graphene is a breakthrough in plasmon-based devices in terms of design, fabrication and applications, thanks to its plasmonic wave distribution,...
-
Molecular Dynamics simulations of thermal conductivity of penta-graphene
PublicationThe thermal conductivity of penta-graphene (PG), a new two dimensional carbon allotrope and its dependence on temperature, strain, and direction are studied in this paper. The thermal conductivity of PG is investigated using a non-equilibrium molecular dynamics simulation (NEMD) with the Two Region Method by applying the optimized Tersoff interatomic potential. Our study shows that the thermal conductivity of PG (determined for...
-
Review of the Application of Graphene-Based Coatings as Anticorrosion Layers
PublicationDue to the excellent properties of graphene, including flexibility that allows it to adjust to the curvature of the substrate surface, chemical inertness, and impermeability, graphene is used as an anticorrosion layer. In this review, we present the current state-of-the-art in the application of graphene in the field of protective coatings. This review provides detailed discussions about the protective properties of graphene coatings...
-
Graphene-based electrochemical biosensing system for medical diagnostics
Publication -
The catalytic potential of high-κ dielectrics for graphene formation
Publication -
Reaction of different microorganisms to novel graphene-based nanomaterials
Publication -
Tailoring Graphene to Achieve Negative Poisson's Ratio Properties
PublicationGraphene can be made auxetic through the introduction of vacancy defects. This results in the thinnest negative Poisson's ratio material at ambient conditions known so far, an effect achieved via a nanoscale de-wrinkling mechanism that mimics the behavior at the macroscale exhibited by a crumpled sheet of paper when stretched.
-
3D porous graphene-based structures- synthesis and applications
PublicationPorous carbon-based materials are of the great industrial and academic interest due to their high surface area, low density, good electrical conductivity, chemical inertness and low cost of fabrication. Up to now, the main approach to obtain porous carbon structures has involved the pyrolysis of carbonaceous natural or synthetic precursors. After the isolation of graphene, the interest in 3D porous graphene-based structures (called...
-
Applying of Doped Graphene Oxide Coatings for Corrosion Prevention
PublicationINTRODUCTION Graphene is a carbonaceous material characterized by extraordinary properties (high electron mobility, high surface area, high mechanical strength of 1100 GPa, very dense network hindering the passage of even the smallest helium atoms) [1]. Therefore, it found many applications, also as an anti-corrosive layer [2]. Electrophoretic Deposition (EPD) is one of the methods to deposit coatings. However, due to slight solubility...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Diamond-Based Supercapacitors with Ultrahigh Cyclic Stability Through Dual-Phase MnO2-Graphitic Transformation Induced by High-Dose Mn-Ion Implantation
PublicationWhile occasionally being able to charge and dischargemore quickly than batteries, carbon-based electrochemical supercapacitors(SCs) are nevertheless limited by their simplicity of processing, adjustableporosity, and lack of electrocatalytic active sites for a range of redox reactions.Even SCs based on the most stable form of carbon (sp3carbon/diamond)have a poor energy density and inadequate capacitance retention during longcharge/discharge...
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Foundations and Trends in Computer Graphics and Vision
Journals -
Journal of Image and Graphics(United Kingdom)
Journals -
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Approximation strategies for routing edge disjoint paths in complete graphs
PublicationPraca dotyczy problemu ścieżek krawędziowo rozłącznych w nieskierowanych grafach pełnych, dla którego podano nowe algorytmy przybliżone: 3.75-przybliżony (model off-line) i 6.47-przybliżony (model on-line). Stosując podobną metodologię, uzyskano algorytm 4.5-przybliżony (off-line) i 6-przybliżony (on-line) dla problemu routingu i kolorowania ścieżek w grafach pełnych.
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.