Filtry
wszystkich: 922
-
Katalog
Wyniki wyszukiwania dla: GRAPH
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaIn 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.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe 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
Czasopisma -
Journal of Image and Graphics(United Kingdom)
Czasopisma -
All graphs with paired-domination number two less than their order
PublikacjaLet 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
PublikacjaLet 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...
-
Application of social relation graphs for early detection of transient spammers
PublikacjaWczesne wykrywanie społecznych zagrożeń i anomalii jest prawdziwym wyzwaniem w dzisiejszch, dynamicznych społeczeństwach. Ludzie tworzą skoplikowane relacje społeczne, które mogą być przedstawione za pomocą różnych typów grafów, których wierzchołki reprezentować mogą aktorów sieci (konkretne osoby lub organizacje) a krawędzie relacje pomiędzy nimi. Analiza tych dynamicznie zmieniających się relacji może wskazywać na niektóre nadciągające...
-
Synchronization helps robots to detect black holes in directed graphs
PublikacjaPraca zawiera nowe wyniki dla problemu poszukiwania czarnej dziury w grafie skierowanym przez zbiór agentów. Czarna dziura jest węzłem niszczącym wszystkich wchodzącej do niej agentów. Pokazano, że w przypadku, gdy stopień wejściowy czarnej dziury wynosi D, do przeszukania grafu skierowanego w modelu synchronicznym wystarcza O(D 2^D) agentów. Wartość ta jest bliska znanemu z literatury oszacowaniu dolnemu Omega (2^D). W pracy pokazano...
-
Approximation strategies for routing edge disjoint paths in complete graphs
PublikacjaPraca 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.
-
Packing Three-Vertex Paths in 2-Connected Cubic Graphs
PublikacjaW pracy rozważano problem rozmieszczanie ścieżek P3 w 2-spójnych grafach 3-regularnych. Pokazano, że w 2-spójnym grafie 3-regularnym o n wierzchołkach można zawsze pokryć 9/11 n wierzchołków przez ścieżki P3; podano także odpowiednie oszacowania górne.
-
Equitable colorings of some variation of corona products of cubic graphs
PublikacjaThe 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.
-
Average distance is submultiplicative and subadditive with respect to the strong product of graphs
PublikacjaWe show that the average distance is submultiplicative and subadditive on the set of non-trivial connected graphs with respect to the strong product. We also give an application of the above-mentioned result.
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublikacjaIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Removal of anionic dyes using magnetic Fe@graphite core-shell nanocomposite as an adsorbent from aqueous solutions
Publikacja -
Trace analyses of gaseous products formed during heat treatment of high stage H2SO4-GICs and expanded graphite
Publikacja -
Physico‐Mechanical Properties and Flammability of PUR/PIR Foams Containing Expandable Graphite Core‐Shell Composite Particles
PublikacjaIn this work, polyurethane/polyisocyanurate (PUR/PIR) foams were modified by two types of expandable graphite (EG) core-shell composite particles. The pulverized EG core-shell composite particles were prepared during emulsion polymerization using methyl methacrylate or glycidyl methacrylate for the synthesis of the polymeric shells (poly(methyl methacrylate) (PMMA) and poly (glycidyl methacrylate) (PGMA)), and then the obtained EG_PMMA...
-
Material Design and Optimisation of Electrochemical Li-Ion Storage Properties of Ternary Silicon Oxycarbide/Graphite/Tin Nanocomposites
PublikacjaIn this work, we present the characterization and electrochemical performance of various ternary silicon oxycarbide/graphite/tin (SiOC/C/Sn) nanocomposites as anodes for lithium-ion batteries. In binary SiOC/Sn composites, tin nanoparticles may be produced in situ via carbothermal reduction of SnO2 to metallic Sn, which consumes free carbon from the SiOC ceramic phase, thereby limiting the carbon content in the final ceramic nanocomposite....
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
How to meet when you forget: log-space rendezvous in arbitrary graphs
PublikacjaTwo identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublikacjaWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Diamond-Based Supercapacitors with Ultrahigh Cyclic Stability Through Dual-Phase MnO2-Graphitic Transformation Induced by High-Dose Mn-Ion Implantation
PublikacjaWhile 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...
-
Applications of Graphene-based Materials in Chromatography and Sample Preparation: A Review
Publikacja -
Facile and continuous synthesis of graphene nanoflakes in RF thermal plasma
Publikacja -
Oxide catalysts for carbon nanotube and few layer graphene formation
Publikacja -
Covalent conjugation of graphene oxide with methotrexate and its antitumor activity
Publikacja -
Reduced graphene oxide and inorganic nanoparticles composites – synthesis and characterization
Publikacja -
Laboratory investigation of graphene modified asphalt efficacy to pavement performance
Publikacja -
Upcycling Waste Polypropylene into Graphene Flakes on Organically Modified Montmorillonite
Publikacja -
Dispersion, compatibility, and rheological properties of graphene-modified asphalt binders
Publikacja -
Enhanced supercapacitor materials from pyrolyzed algae and graphene composites
PublikacjaThis study focuses on the synthesis and characterization of supercapacitor materials derived from pyrolyzed natural compounds. Four compounds were investigated: methylcellulose with lysine (ML), methylcellulose with lysine-graphene composite (MLG), algae (A), and algae-graphene composite (AG). The pyrolysis process was utilized to convert these natural compounds into carbon-based materials suitable for supercapacitor applications....
-
Tailoring properties of reduced graphene oxide by oxygen plasma treatment
PublikacjaWe report an easily controllable, eco-friendly method for tailoring the properties of reduced graphene oxide (rGO) by means of oxygen plasma. The effect of oxygen plasma treatment time (1, 5 and 10 minutes) on the surface properties of rGO was evaluated. Physicochemical characterization using microscopic, spectroscopic and thermal techniques was performed. The results revealed that different oxygen-containing groups (e.g. carboxyl,...
-
Chemical modifications of graphene and their influence on properties of polyurethane composites: a review
PublikacjaPolyurethane composites are materials of great interest nowadays due to their wide range of available forms and applications in industry. Controlling and achieving unique properties via matrix modifications and addition of various specific nanofillers seems be one of the key elements to success. The purpose of this work is to briefly present some examples of graphene nanoderivatives, their syntheses, properties and influence on...
-
Modelling of Graphene Field-Effect Transistor for lectronic sensing applications
PublikacjaA top-gated Graphene Field-Effect Transistor (GFET) suitable for electronic sensing applications was modelled. The applied simulation method reproduces correctly the output transfer GFET characteristics and allows to investigate doping effect caused by different physical, chemical or biological factors. The appearance of additional charge in the system results in the shift of the current-voltage characteristic. This feature could...
-
Graphene oxide aerogels for adsorptive separation of aromatic hydrocarbons and cycloalkanes
PublikacjaEfficient separation of benzene and cyclohexane has critical importance for production of commodity chemicals, and is one of the most challenging separations in the industry. Physisorption by recyclable, porous solids has a significant potential in substituting energy-intensive azeotropic or extractive distillation methods. Reduced graphene oxide aerogels (rGOAs) are emerging materials holding great promise for connecting unique...
-
The protective properties of graphene oxide coatings functionalized with phosphorus atoms.
PublikacjaRecently, electrophoretically deposited graphene oxide coatings are commonly applied as an anti-corrosion layer. However, improper adjustment of electrophoretic deposition (EPD) parameters as well as the hydrophilic nature of graphene oxide contribute to the formation of defects in the coatings and the increase in the wetting properties, respectively, and thus lead to a reduction of protective properties. The growth of wetting...
-
Ni-based compounds in multiwalled graphitic shell for electrocatalytic oxygen evolution reactions
Dane BadawczeThis study investigates Ni-based compounds (Ni, NiO, Ni3C) coated with a graphitic shell as electrocatalysts for the oxygen evolution reaction (OER). Electron paramagnetic resonance (EPR) and X-ray diffraction (XRD) are employed to identify the presence and contribution of Nickel ions (Ni0, Ni2+, Ni3+) and determine the phase composition. Electrochemical...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublikacjaThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
Efficient list cost coloring of vertices and/or edges of some sparse graphs
PublikacjaRozważane jest kolorowanie wierzchołków i krawędzi grafów w modelach klasycznym, totalnym i pseudototalnym z uwzględnieniem dodatkowego ograniczenia w postaci list dostępnych kolorów. Proponujemy wielomianowy algorytm oparty na paradygmacie programowania dynamicznego dla grafów o strukturze drzewa. Wynik ten można uogólnić na grafy o liczbie cyklomatycznej ograniczonej z góry przez dowolnie wybraną stała.
-
All graphs with restrained domination number three less than their order
PublikacjaW pracy opisana jest rodzina wszystkich grafów, dla których liczbadominowania zewnętrznego jest o trzy mniejsza od ich rzędu.
-
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs
Publikacja -
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Publikacja -
Modelling electrical machines using bond graphs for mechatronics system applications.
PublikacjaW artykule przedstawiono modelowanie maszyn elektrycznych metodą grafów wiązań dla potrzeb mechatroniki. Omówiono ogólne założenia modelowania maszyn elektrycznych w ujęciu grafów wiązań, bazującego na modelach wzorcowego sprzężenia transformatorowego i elektromechanicznego. Wykorzystując modele tych sprzężeń przedstawiono w ujęciu grafów wiązań model maszyny indukcyjnej w układzie współrzędnych naturalnych stojana. Model opracowano...
-
Modelling of distributed-lumped parameter systems by application of modal bond graphs.
PublikacjaZastosowano metodę transmitancji układów o parametrach rozłożonych oraz dekompozycję modalną do modelowania wybranych układów dynamicznych. Zaproponowane podejście pozwala otrzymać dokładne modele niskiego rzędu w postaci grafów wiązań.
-
Spam classification methods besed on users e-mail communication graphs
PublikacjaW artykule poddano analizie grafy zbudowane w oparciu o logi serwerów pocztowych. Węzły grafów reprezentują nadawców i odbiorców wiadomości e-mail natomiast krawędzie przedstawiają procesy wymiany wiadomości e-mail. Analiza grafów pozwala na znalezienie korelacji pomiędzy topologią grafów a relacjami pomiędzy użytkownikami serwisu pocztowego. W oparciu o te relacje zaproponowano algorytm klasyfikujący wymieniane wiadomości e-mail...
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublikacjaIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
On Optimal Backbone Coloring of Split and Threshold Graphs with Pairwise Disjoint Stars
Publikacja -
Improving the Performance of a Graphite Foil/Polyaniline Electrode Material by a Thin PEDOT:PSS Layer for Application in Flexible, High Power Supercapacitors
PublikacjaIn this study, we present a novel strategy for enhancing polyaniline stability and thus obtaining an electrode material with practical application in supercapacitors. A promising (graphite foil/polyaniline/poly(3,4-ethylenedioxythiophene):poly(styrenesulfonate) GF/PANI/PEDOT:PSS) electrode material was characterized and used in the construction of a symmetric supercapacitor that provides an outstanding high power density. For this...
-
An adaptive approach to non-destructive evaluation (NDE) of cast irons containing precipitated graphite particles with the help of magnetoacoustic emission
PublikacjaPhysical properties of cast irons strongly depend on both their microstructure and the presence of casting defects. The paper analyses the possibility of application of magnetoacoustic emission (MAE) for nondestructive detection of flawed cast iron components. The investigated samples containing dross, chunky graphite and lamellar graphite were compared with the reference, flawless, spheroidal cast iron sample. The optimisation...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...