Filters
total: 917
filtered: 735
Search results for: graph
-
Domination numbers in graphs with removed edge or set of edges
PublicationW artykule przedstawiony jest wpływ usuwania krawędzi lub zbioru krawędzi na liczby dominowania spójnego i słabo spójnego.
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Publication -
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
PublicationW artykule rozważamy listowo-kosztowe kolorowanie wierzchołków i krawędzi grafu w modelu wierzchołkowym, krawędziowym, totalnym i pseudototalnym. Stosujemy programowanie dynamiczne w celu otrzymania algorytmów wielomianowych dla drzew. Następnie uogólniamy to podejście na dowolne grafy z ograniczonymi liczbami cyklomatycznymi i na ich multikolorowania.
-
Controlled oxidation of graphite to graphene oxide with novel oxidants in a bulk scale
Publication -
Minimum vertex ranking spanning tree problem for chordal and proper interval graphs
PublicationW pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....
-
Laser-Induced Graphitization of Polydopamine on Titania Nanotubes
PublicationSince the discovery of laser-induced graphite/graphene, there has been a notable surge of scientific interest in advancing diverse methodologies for their synthesis and applications. This study focuses on the utilization of a pulsed Nd:YAG laser to achieve graphitization of polydopamine (PDA) deposited on the surface of titania nanotubes. The partial graphitization is corroborated through Raman and XPS spectroscopies and supported...
-
Graphomotor functions in ADHD – motor or planning deficit? A microgenetic approach
Publication -
On the graphitisation role of oxide supports in carbon nanotube CVD synthesis
Publication -
Engineer's graphic workshop. Historical review.
PublicationThe paper introduces the history of development of graphic engineering workshop within European culture. The fundamentals of scientific approach to this subject are dated back to the XVIII century. Owning to Gaspard Monge's works descriptive geometry rose to the rank of branch of mathematics. As the time passes we observe the endeavors aiming at accelerating and automating the process of engineering drawing. Since the XX century...
-
Impossible objects in geometry and graphic education
PublicationW artykule przedstawiono propozycję wprowadzenia do programu nauczania z geometrii przestrzennej i grafiki inżynierskiej obiektów niemożliwych (tworzonych między innymi przez M.C. Eschera). Celem analizy fenomenu obiektów niemożliwych w kontekście odwzorowań płaskich obiektów przestrzennych, a także percepcji przestrzeni jest wzbogacenie wyobrażni przestrzennej i kreatywności studentów.
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...
-
Smart Pen - new multimodal computer control tool for graphomotorical therapy
PublicationW sytuacji, gdy około 15% populacji uczniów wykazuje cechy dyslektyczne, koniecznością staje się wyposażenie szkół w efektywne narzędzia do diagnozy i terapii tego rodzaju zaburzeń. Dzięki wykorzystaniu tabletu i specjalnie skonstruowanego długopisu wyposażonego w czujniki nacisku uzyskano możliwość monitorowania wielu parametrów, które do tej pory były dla terapeutów całkowicie niedostępne (np. pomiar nacisku na podłoże czy ścisku...
-
Stereoscopy in Graphics APIs for CAVE Applications
PublicationThe paper compares the advantages and disadvantages of a variety of Graphics Application Programming Interfaces (APIs) from the perspective of obtaining stereoscopy in applications written for a CAVE virtual reality environment. A number of problems have been diagnosed and an attempt has been made to solve them using OpenGL, DirectX 11 and 12, Vulkan, as well as the Unity Engine which can internally use DirectX, OpenGL and Vulkan,...
-
Relativistic hydrodynamics on graphics processing units
Publication -
Low-Temperature Exfoliated Graphenes: Vacuum-Promoted Exfoliation and Electrochemical Energy Storage
Publication -
Mulimedia manuals for descriptive geometry and engineering graphics
PublicationThe article discusses issues connected with ICT (Information and Communication Technologies) implementation in Descriptive Geometry and Engineering Graphics Education. The presentation of the issues is supported by the author's multimedia manuals made in Multimedia Flash MX technology and published on the Gdańsk University of Technology net.
-
A facile strategy for reclaiming discarded graphite and harnessing the rate capabilities of graphite anodes
PublicationGraphite negative electrodes are unbeaten hitherto in lithium-ion batteries (LiBs) due to their unique chemical and physical properties. Thus, the increasing scarcity of graphite resources makes smart recycling or repurposing of discarded graphite particularly imperative. However, the current recycling techniques still need to be improved upon with urgency. Herein a facile and efficient hydrometallurgical process is reported to...
-
Human Preference Modelling in Usability of Graphical Interfaces
Publication -
Optimization of a FDTD code for graphical processing units
PublicationArtykuł prezetuje implementację algorytmu FDTD w postaci jawnej przeznaczonej dla kart graficznych. Wykazany został wzrost efektywności obliczeń numerycznych w odniesieniu do implementacji przeznaczonej dla procesora komputerowego.
-
Quality of graphical markers for the needs of eyewear devices
Publicationin this paper we propose to cast the problem of identification of people, objects or places into an application for smart glasses that decodes information from graphical markers. We focus on analyzing different factors that can have influence on the processes of the automatic recognition of information from a code. The research we present aims at reviewing recognition performances in function of: size of a marker, distance from/to...
-
Feature extraction in detection and recognition of graphical objects
PublicationDetection and recognition of graphic objects in images are of great and growing importance in many areas, such as medical and industrial diagnostics, control systems in automation and robotics, or various types of security systems, including biometric security systems related to the recognition of the face or iris of the eye. In addition, there are all systems that facilitate the personal life of the blind people, visually impaired...
-
Preface of guest editors
PublicationA special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 12th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 16-21 September 2007 in Karpacz, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, 2003 and 2005 in Karpacz. About 70 participants formed the audience of six invited lectures and 68...
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
Preface
PublicationThis special issue of Discussiones Mathematice Graph Theory (DMGT) is dedicated to selected papers presented at the 13th Workshop on Graph Theory: Colourings, Independence and Domination (CID) held on 18-23 September 2009 in Szklarska Poręba, Poland. It continues a series of international workshops: 1993-1997 in Lubiatów, 1998-2001 in Gronów, and 2003-2007 in Karpacz. The meeting was organized by the Faculty of Mathematics, Computer...
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Weakly connected domination subdivision numbers
PublicationLiczba podziału krawędzi dla dominowania słabo spójnego to najmniejsza liczba krawędzi jaką należy podzielić, aby wzrosła liczba dominowania słabo wypukłego. W pracy przedstawione są własności liczby podziału krawędzi dla dominowania słabo spójnego dla różnych grafów.
-
Trees with equal restrained domination and total restrained domination numbers
PublicationW publikacji scharakteryzowano wszystkie drzewa, w których liczby dominowania powściągniętego oraz podwójnie totalnego są sobie równe.
-
Total outer-connected domination in trees
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania totalnego zewnętrznie spójnego w grafach oraz scharakteryzowano wszystkie drzewa osiągające to ograniczenie.
-
Convex universal fixers
PublicationPraca dotyczy dominowania wypukłego w grafach pryzmowych.
-
Functionalization of Graphite with Oxidative Plasma
Publication -
Implementation of matrix-type FDTD algorithm on a graphics accelerator
PublicationArtykuł prezetuje implementację algorytmu FDTD w postaci macierzowej przeznaczonej dla kart graficznych. Wykazany został wzrost efektywności obliczeń numerycznych w odniesieniu do implementacji przeznaczonej dla procesora komputerowego.
-
Krylov Space Iterative Solvers on Graphics Processing Units
PublicationCUDA architecture was introduced by Nvidia three years ago and since then there have been many promising publications demonstrating a huge potential of Graphics Processing Units (GPUs) in scientific computations. In this paper, we investigate the performance of iterative methods such as cg, minres, gmres, bicg that may be used to solve large sparse real and complex systems of equations arising in computational electromagnetics.
-
The Choice of Exercises on Technical Graphics at the Specialization of Geodesy and Cartography
Publication -
Photocatalytic performance of alkali metal doped graphitic carbon nitrides and Pd-alkali metal doped graphitic carbon nitride composites
Publication -
Active and Dynamic Graphical Code for Object Identification in Healthcare
PublicationA new approach for item marking using two dimensional discrete graphics markers. Proposed solution allow o change the code rapidly, upon request and in the case of thermal markers make the code invisible for unauthorized observers. Connecting the proposed codes with wearable multmedial platform such as eGlasses can create new possibilities in human-environment interaction.
-
The Evaluation of Use of Colors in Graphical User-Interfaces in Healthcare
PublicationIn this paper, color difference/contrast measures are investigated in reference to results of experiments with the participation of average, color-normal observers and with individuals with deuteranopia. Additionally, a new method for the automatic analysis of color contrast is proposed, which supports designers of graphical user- interfaces in healthcare. The method was verified using the GUI phantom of a vital signs monitor (the...
-
EMG and gaze based interaction with graphic interface of smart glasses application
PublicationIn this paper we investigate the effectiveness of the interaction using eye tracking and electromyography. Smart glasses requires reliable interfaces for controlling the graphic content displayed directly in front of the user's eye. Presented research is related with the eGlasses project, which is focused on the development of an open platform in the form of multisensory electronic glasses and related interaction methods. One of...
-
Generation of large finite-element matrices on multiple graphics processors
PublicationThis paper presents techniques for generating very large finite-element matrices on a multicore workstation equipped with several graphics processing units (GPUs). To overcome the low memory size limitation of the GPUs, and at the same time to accelerate the generation process, we propose to generate the large sparse linear systems arising in finite-element analysis in an iterative manner on several GPUs and to use the graphics...
-
Implementation of FDTD-Compatible Green's Function on Graphics Processing Unit
PublicationIn this letter, implementation of the finite-difference time domain (FDTD)-compatible Green's function on a graphics processing unit (GPU) is presented. Recently, closed-form expression for this discrete Green's function (DGF) was derived, which facilitates its applications in the FDTD simulations of radiation and scattering problems. Unfortunately, implementation of the new DGF formula in software requires a multiple precision...
-
Preparation of exfoliated graphite by microwave irradiation
Publication -
Tuning the Laser-Induced Processing of 3D Porous Graphenic Nanostructures by Boron-Doped Diamond Particles for Flexible Microsupercapacitors
PublicationCarbon (sp3)-on-carbon (sp2) materials have the potential to revolutionize fields such as energy storage and microelectronics. However, the rational engineering and printing of carbon-on-carbon materials on flexible substrates remains a challenge in wearable electronics technology. This study demon-strates the scalable fabrication of flexible laser-induced graphene (LIG)-boron doped diamond nanowall (BDNW) hybrid nanostructures...
-
Graphical interface adaption for children to explain astronomy proportions and distances
PublicationMobile Science Center is a Polish project that seeks to bring astronomy knowledge to wider social groups through various applications. In its development it is necessary to design a graphical interface that explains a concept that is difficult to assimilate such as spatial proportions and distances. This paper develops a framework to create graphical representations that explain this learning to the target audience of children....
-
The application of GIS and 3D graphic software to visual impact assessment of wind turbines
Publication -
Piezoresistive properties of cement composites with expanded graphite
Publication -
Connection graphs
Publication -
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
A graphical approach to yield and boundary surfaces of selected hypoplastic constitutive equations
PublicationThe article describes how to identify the boundary and yield surface for hypoplastic constitutive equations proposed by Wu, Gudehus and Bauer. It is shown how to identify and plot the surfaces for any equation in this class. Calculation errors are analyzed characteristic for appleid set of numerical formulas. In the paper there are computer links to the source code prepared in the MATLAB system, based on istructions in the article....
-
Oxygen biosensor based on carbon nanotubes directly grown on graphitic substrate
PublicationFilms of carbon nanotubes were synthesized on the graphitic substrates by CVD method in the presence of catalyst. Two different catalysts were used, that is nickel and iron, supported on graphitic substrates. The as-obtained nanotubes were analyzed by SEM imaging with EDX and Raman spectroscopy. The results revealed their multi-walled morphology. Free radical reaction was carried out in order to chemically functionalize synthesized...