Filtry
wszystkich: 2824
-
Katalog
- Publikacje 2377 wyników po odfiltrowaniu
- Czasopisma 77 wyników po odfiltrowaniu
- Konferencje 6 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 35 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Kursy Online 15 wyników po odfiltrowaniu
- Dane Badawcze 312 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: OPTICAL GLYPHS
-
Compact cyclic edge-colorings of graphs
PublikacjaArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
Colorings of the Strong Product of Circulant Graphs
PublikacjaGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
The complexity of equitable vertex coloring graphs
PublikacjaW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublikacjaMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
Interval incidence coloring of bipartite graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
The Backbone Coloring Problem for Small Graphs
PublikacjaIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
The hat problem on a union of disjoint graphs
PublikacjaThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Non-isolating 2-bondage in graphs
PublikacjaA 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)....
-
On the metric dimension of corona product graphs
PublikacjaWe give several results on the metric dimension of corona product graphs.
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Equitable coloring of corona products of graphs
PublikacjaIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
On the hardness of computing span of subcubic graphs
PublikacjaIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
On domination multisubdivision number of unicyclic graphs
PublikacjaThe paper continues the interesting study of the domination subdivision number and the domination multisubdivision number. On the basis of the constructive characterization of the trees with the domination subdivision number equal to 3 given in [H. Aram, S.M. Sheikholeslami, O. Favaron, Domination subdivision number of trees, Discrete Math. 309 (2009), 622–628], we constructively characterize all connected unicyclic graphs with...
-
Dynamic F-free Coloring of Graphs
PublikacjaA 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...
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
On Computational Aspects of Greedy Partitioning of Graphs
PublikacjaIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
Distributed Evacuation in Graphs with Multiple Exits
PublikacjaWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
Computational aspects of greedy partitioning of graphs
PublikacjaIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Optical Fibre Control-Measurement Systems Of Compound HV/HP Electrical Equipment
Publikacja -
High Quality Medical Image-Guides By Mosaic-Assembling Optical Fibre Technology
Publikacja -
Pi of the Sky – all-sky, real-time search for fast optical transients
Publikacja -
Potential Aluminium(III)- and Gallium(III)-selective Optical Sensors Based on Porphyrazines
Publikacja -
Numerical modelings of ultrashort pulse propagation and conical emission in multimode optical fibers
Publikacja -
Thallium indium germanium sulphide (TlInGe2S6) as efficient material for nonlinear optical application
Publikacja -
Optical properties of a dielectric slab front-loaded with a grating of plasmonic silver nanowires
Publikacja -
Priority-enabled optimization of resource utilization in fault-tolerant optical transport networks.
PublikacjaW artykule zaproponowano nowe podejście do optymalizacji rozdziału zasobów przeżywalnych sieci rozległych, które uzależnia szybkość przywracania ciągłości połączenia od klasy usługi. Wykazano, iż proponowana metoda nie powoduje wydłużania ścieżek zabezpieczających (w przypadku usług w wymaganej wysokiej jakości obsługi) lub czyni to w sposób minimalny (dla pozostały usług). Ze względu na fakt, że zadanie znalezienia ścieżek aktywnych...
-
Investigation of H2:CH4 plasma composition by means of spatially resolved optical spectroscopy
PublikacjaThe system based on spatially resolved optical emission spectroscopy dedicated for in situ diagnostics of plasma assisted CVD processes is presented in this paper. Measurement system coupled with chemical vapour deposition chamber by dedicated fiber-optic paths enables investigation of spatial distribution of species densities (Hx, H+, CH, CH+) during chemical vapour deposition process. Experiments were performed for a various...
-
Optical and photocatalytic properties of rare earth metal-modified ZnO quantum dots
Publikacja -
Reduction of spectral interferences in atmospheric pressure glow discharge optical emission spectrometry
Publikacja -
Optical, colloidal and biological properties of up-converting nanoparticles embedded in polyester nanocarriers
Publikacja -
Deposition of EDOT-Decorated Hollow Nanocapsules into PEDOT Films for Optical and Electrochemical Sensing
Publikacja -
Electronic structure and optical properties of boron doped single-wall carbon nanotubes
Publikacja -
Potential application of pure silica optical flat fibers for radiation therapy dosimetry
Publikacja -
In situ optical studies of thermal stability of iodine-doped polyazomethine thin films
Publikacja -
Optical and chemical characterization of thin TiNx films deposited by DC-magnetron sputtering
PublikacjaThin titanium nitride (tinx) films were deposited on silicon substrates by means of a reactive dc-magnetron plasma. Layers were synthesized under various conditions of discharge power and nitrogen flows in two operation modes of the magnetron (the so-called "balanced" and "unbalanced" modes). The optical constants of the tinx films were investigated by spectroscopic ellipsometry (se). X-ray photoelectron spectroscopy (xps) was...
-
Fast dynamics in the optical storage with Langmuira-Blodgett films of a diazocrown ether molecule
PublikacjaMolekuły z resztą azobenzenu badano z punktu widzenia licznych aplikacji wykorzystujących cykle fotoizomeryzacji trans-cis-trans, wiodących do uporządkowania cząsteczek, a nawet do transportu masy w mikroskali. Ważnym ograniczeniem dla tych materiałów jest powolna dynamika procesu porządkowania, wymagającego molekularnych przekształceń. W tej pracy informujemy o filmach Langmuira-Blodgett (LB) pochodnej eteru azokoronowego (29-membered...
-
Electro-optical system for the automated selection of dental implants according to their colour matching
Publikacja -
The method of improving the dynamic range of jitter analyzers in optical-fiber transmission systems
Publikacja -
Structural and optical investigations of sol-gel derived lithium titanate thin films
Publikacjain this paper structural and optical studies of lithium titanate (lto) thin films are presented. nanocrystalline thin films with 800 nm thickness were prepared by sol-gel method. to examine the influence of the annealing time on as-prepared films crystallization, the coatings were heated at 550 °c for 10, 20 and 80 h. structure of manufactured thin films was investigated using x-ray diffraction (xrd). the most visible lithium titanate...
-
Modeling of selected transducer designs for optical pressure sensors using polarization interferometry
PublikacjaW artykule przedstawiono wyniki modelowania metodą Elementów Skończonych wybranych konstrukcji membran do zastosowań w interferometrycznych czujnikach ciśnienia. Omówiono zależność prametrów membran od kształtu membrany, jej wymiarów i zastosowanego materiału. Zakres odkształcen badanych membran jest niezbyt duży, co może pogarszać dokładność pomiaru czujników ciśnienia, w których będą one stosowane Omówiono kierunki dalszych...
-
An Optical Low-Coherence System for 2-Dimensional Visualization of Thin Polymer Layers
PublikacjaW artykule omówiono zasadę działania i przedstawiono podstawowe właściwości systemu OCT (Optical Coherence Tomography). Na przykładzie folii polietylenowej przedyskutowano możliwości wykorzystania systemu do badanie wewnętrznej struktury warstwowej obiektów niebiologicznych. Przedstawiono i omówiono wyniki przeprowadzonych badań nad warstwowymi materiałami przeźroczystymi.
-
Electronic and optical properties of theMg2−xFexSiO4spinel: From band insulator to Mott insulator
Publikacja -
SU‐GG‐T‐290: A Fast Optical CT Scanner for Gel Dosimetry
Publikacja -
Sythesis and Characterization of Optical Sol-Gel Adhesive for Military Protective Polycabonate Resin.Wytwarz
PublikacjaPrzedstawiono proces syntezy spoiw optycznych do laminatów poliwęglanowych. Scharakteryzowano właściwości optyczne i mechniczne. W procesie syntezy zastosowano monitoring ramanowski do diagnostyki przebiegu bazowych reakcji chemicznych.
-
Tunable semiconductor laser application for interferometric optical fibersensors.Optical and Electronic Sensors V.
PublikacjaW pracy przedstawiono metody stabilizacji punktu pracy światłowodowych sensorów interferometrycznych. W metodach tych wykorzystuje się układy regulacji sterujące długością fali przestrajalnego lasera półprzewodnikowego. Przedstawiono tryby pracy układów regulacji oraz problemy związane z ich projektowaniem i realizacją. Przeanalizowano ograniczenia sensorów wykorzystujących powyższe układy. Dokonano weryfikacji eksperymentalnej...