Search
Search results for: GRAPH
-
Comparative Analysis of Regular Grid Based Algorithms in the Design of Graphical Control Panels
Publication -
Subjective Perception of the Background Color and Layout in the Design of Typical Graphical Control Panels
Publication -
The effects of graphical interface design characteristics on human–computer interaction task efficiency
Publication -
CAVER Analyst 1.0: graphic tool for interactive visualization and analysis of tunnels and channels in protein structures
Publication -
Named Property Graphs
Publication -
Serialization for Property Graphs
Publication -
On the deficiency of bipartite graphs
Publication -
Sum Coloring of Graphs.
PublicationRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Harmonions Coloring of Graphs.
PublicationProblem 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.
PublicationRozdział 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.
-
Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Circular colorings of graphs.
PublicationRozdział 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.
PublicationNiniejszy 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.
-
Non-isolating bondage in graphs
PublicationA 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')...
-
Effect of graphene thickness on photocatalytic activity of TiO2-graphene nanocomposites
Publication -
Synthesis, dispersion, and cytocompatibility of graphene oxide and reduced graphene oxide
Publication -
Computer graphics toos application for visualsation of measurements results of ship hull sections and blocks.
PublicationOpisano 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
PublicationIn 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...
-
Influence of Hydrogenation on Morphology, Chemical Structure and Photocatalytic Efficiency of Graphitic Carbon Nitride
Publication -
Extraordinary Adsorption of Methyl Blue onto Sodium-Doped Graphitic Carbon Nitride
Publication -
Adsorption performance of graphitic carbon nitride-based materials: Current state of the art
Publication -
Surface properties tuning of exfoliated graphitic carbon nitride for multiple photocatalytic performance
Publication -
Photocatalytic activity of zinc oxide nanorods incorporated graphitic carbon nitride catalyst
PublicationBackground 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...
-
Bondage number of grid graphs
PublicationThe 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
PublicationA 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
PublicationIn 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
PublicationIn 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
PublicationIn 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
PublicationIn 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
PublicationAn 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
PublicationA 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...
-
Engineering Graphics I, W/P, MiBM, sem 01, zimowy 2021/2022 (PG_00055216)
e-Learning CoursesKurs dla zajęć z Grafiki Inżynierskiej I dla MiBM spec. DaPE --- Course for the Enginnering Graphics I for DaPE
-
Global edge alliances in graphs
PublicationIn 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...
-
Examining users’ preferences towards vertical graphical toolbars in simple search and point tasks
Publication -
COMPUTER GRAPHICS FORUM
Journals -
COMPUTERS & GRAPHICS-UK
Journals -
COMPUTER GRAPHICS WORLD
Journals -
JOURNAL FOR GEOMETRY AND GRAPHICS
Journals -
COMPUTER GRAPHICS-US
Journals -
Journal of Image and Graphics
Journals -
ACM TRANSACTIONS ON GRAPHICS
Journals -
Computers and Graphics: X
Journals -
Graphics and Visual Computing
Journals -
Multifunctional cement composites with expanded graphite for temperature monitoring of buildings
Publication -
Tuning the work function of graphite nanoparticles via edge termination
PublicationGraphite 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...
-
Application of 3D graphic software and GIS in visual impact assessment of high-voltage overhead transmission lines
Publication -
GRAPHENE IN GAS CHEMIRESISTORS
PublicationGraphene 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...
-
Non-isolating 2-bondage in graphs
PublicationA 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 non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
International Circular of Graphic Education and Research
Journals -
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...