# Wyniki wyszukiwania dla: CUBIC GRAPH - MOST Wiedzy

## Wyszukiwarka

Wyniki wyszukiwania dla: CUBIC GRAPH
• wyników na stronę:

wszystkich: 488

### Wyniki wyszukiwania dla: CUBIC GRAPH

• #### Total Domination Versus Domination in Cubic Graphs

A dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...

Pełny tekst w portalu

• #### Total domination in versus paired-domination in regular graphs

Publikacja

A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...

Pełny tekst w portalu

• #### On bipartization of cubic graphs by removal of an independent set

Publikacja

- DISCRETE APPLIED MATHEMATICS - 2016

We study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.

Pełny tekst w serwisie zewnętrznym

• #### Tighter bounds on the size of a maximum P3-matching in a cubic graph

Publikacja

W pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n&gt;16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.

Pełny tekst w serwisie zewnętrznym

• #### Packing Three-Vertex Paths in 2-Connected Cubic Graphs

Publikacja

- ARS COMBINATORIA - 2008

W 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.

Pełny tekst w serwisie zewnętrznym

• #### Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

Publikacja

In 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...

Pełny tekst w serwisie zewnętrznym

• #### Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring

Publikacja

A 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...

Pełny tekst w serwisie zewnętrznym

• #### Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

Publikacja

- Archives of Control Sciences - 2015

Pełny tekst w serwisie zewnętrznym

• #### Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych

Publikacja

- 2014

W pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.

• #### Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines

Publikacja

The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...

Pełny tekst w portalu

• #### Shales Leaching Modelling for Prediction of Flowback Fluid Composition

Publikacja

- ENERGIES - 2019

The object of the paper is the prediction of flowback fluid composition at a laboratory scale, for which a new approach is described. The authors define leaching as a flowback fluid generation related to the shale processing. In the first step shale rock was characterized using X-ray fluorescence spectroscopy, X-ray diractometry and laboratory analysis. It was proven that shale rock samples taken from the selected sections of horizontal...

Pełny tekst w portalu

• #### SPECTRAL DYNAMIC ANALYSIS OF A STATIONARY JACK-UP PLATFORM

Publikacja

The paper refers to the dynamic short-term response analysis of the Baltic steel drilling platform (see Fig.2) in a random sea-state represented by one-dimensional wave spectrum proposed by Striekalov and Massel and it is recommended for the Baltic Sea area. The Baltic drilling platform is a jack-up type platform for the exploration and exploitation of oil under the Baltic Sea. The analysis presented deals with the stationary...

Pełny tekst w portalu

• #### Predicting Performance of Lightweight Concrete with Granulated Expanded Glass and Ash Aggregate by Means of Using Artificial Neural Networks

Publikacja

- Materials - 2019

Lightweight concrete (LWC) is a group of cement composites of the defined physical, mechanical, and chemical performance. The methods of designing the composition of LWC with the assumed density and compressive strength are used most commonly. The purpose of using LWC is the reduction of the structure’s weight, as well as the reduction of thermal conductivity index. The highest possible strength, durability and low thermal conductivity...

Pełny tekst w portalu

• #### The analysis of tram tracks geometrical layout based on Mobile Satellite Measurements

In this article, the results of the research in a field of which uses active global navigation satellite system (GNSS) geodetic networks for the inventory of geodetic geometric tram tracks are presented. The applied measurement technique has been adapted for the designing of the geometric layout of tram tracks. Several configurations of receivers and settings of an active GNSS networks with the objective to increase the accuracy...

Pełny tekst w portalu

• #### How proteins bind to DNA: target discrimination and dynamic sequence search by the telomeric protein TRF1

Publikacja

Target search as performed by DNA-binding proteins is a complex process, in which multiple factors contribute to both thermodynamic discrimination of the target sequence from overwhelmingly abundant off-target sites and kinetic acceleration of dynamic sequence interrogation. TRF1, the protein that binds to telomeric tandem repeats, faces an intriguing variant of the search problem where target sites are clustered within short fragments...

Pełny tekst w portalu

• #### Nonlinear finite element modeling of vibration control of plane rod-type structural members with integrated piezoelectric patches

Publikacja

This paper addresses modeling and finite element analysis of the transient large-amplitude vibration response of thin rod-type structures (e.g., plane curved beams, arches, ring shells) and its control by integrated piezoelectric layers. A geometrically nonlinear finite beam element for the analysis of piezolaminated structures is developed that is based on the Bernoulli hypothesis and the assumptions of small strains and finite...

Pełny tekst w portalu

• #### Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines

Publikacja

- DISCRETE APPLIED MATHEMATICS - 2018

We 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&gt;s2=s3.

Pełny tekst w serwisie zewnętrznym

• #### Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs

Publikacja

- 2016

In 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 &gt;= 7n/20 and polynomially solvable if s &lt;= 7n/21, where s is the size of maximum color class of the coloring.

Pełny tekst w serwisie zewnętrznym

• #### Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs

Publikacja

- DISCRETE APPLIED MATHEMATICS - 2018

We consider the complexity of semi-equitable k-coloring, k&gt;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&gt;n/3, and it is polynomially solvable if s, n/3.

• #### ENERGY ANALYSIS OF PROPULSION SHAFT FATIGUE PROCESS IN ROTATING MECHANICAL SYSTEM PART I TESTING SIGNIFICANCE OF INFLUENCE OF SHAFT MATERIAL FATIGUE EXCITATION PARAMETERS

Publikacja

The article discusses the problem of mathematical modelling of energy conversion processes in a rotating mechanical system for the purpose of identifying fatigue states of propulsion shafts in this system. A simplified physical model of the analysed system, constructed in an appropriate scale, has made the basis for the experimental research. The research programme took into consideration mechanical fatigue excitation of the model...

Pełny tekst w portalu

• #### SELECTED COMBINED POWER SYSTEMS CONSISTED OF SELFIGNITION ENGINE AND STEAM TURBINE

Publikacja

This paper presents optimization of selected combined diesel engine-steam turbine systems. Two systems: the system combined with waste heat one-pressure boiler only and its version containing additionally low-pressure boiler proper feeding degasifier and the system of two-pressure cycle, were taken into considerations. Their surplus values of power output and efficiency associated with utilization of waste heat contained in piston...

Pełny tekst w portalu

• #### The propagation of the waves in the CTO S.A. towing tank

Publikacja

The paper presents the results of research focused on the wave propagation in the CTO S.A. deepwater towing tank. In the scope of paper, the wavemaker transfer function was determined for regular waves, based on the Biésel Transfer Function and further for irregular waves, based on Hasselman model of nonlinear energy transfer. The phenomena: wave damping, wave breakdown and wave reflection, were measured, analyzed and mathematically...

Pełny tekst w portalu

• #### INCREASING POWER SUPPLY SAFETY IN THE ASPECT OF SUPPORTING THE RENEWABLE ENERGY SOURCES BY CONVENTIONAL AND VIRTUAL POWER STORES

Publikacja

This paper presents characteristics and purposefulness of supporting the renewable energy sources (OZE) by means of energy stores. The main emphasis was placed on analysis of virtual energy stores available for implementation in Polish economy conditions. A role which management of Demand Side Response (DSR) may play in balancing Polish electric power system, is discussed. Implementation of such solutions together with conventional...

Pełny tekst w portalu

• #### The accretion of the new ice layer on the surface of hexagonal ice crystal and the influence of the local electric field on this process

Publikacja

The process of creation of a new layer of ice on the basal plane and on the prism plane of a hexagonal ice crystal is analyzed. It is demonstrated that the ordering of water molecules in the already existing crystal affects the freezing. On the basal plane, when the orientations of water molecules in the ice block are random, the arrangement of the new layer in a cubic manner is observed more frequently — approximately 1.7 times...

Pełny tekst w portalu

• #### EvOLAP Graph – Evolution and OLAP-Aware Graph Data Model

Publikacja

- 2018

The objective of this paper is to propose a graph model that would be suitable for providing OLAP features on graph databases. The included features allow for a multidimensional and multilevel view on data and support analytical queries on operational and historical graph data. In contrast to many existing approaches tailored for static graphs, the paper addresses the issue for the changing graph schema. The model, named Evolution...

Pełny tekst w serwisie zewnętrznym

• #### The electronic characterization of the cubic Laves-phase superconductor CaRh2

Publikacja

We present the synthesis and experimental characterization of the electronic properties of the cubic Laves phase superconductor CaRh2. Its crystal structure was confirmed by powder X-ray diffraction and its ambient temperature lattice parameter (a = 7.5326(6) Å) is in good agreement with the literature. Magnetization, resistivity and heat-capacity measurements indicate that CaRh2 is a moderate-coupling type-II superconductor (λe-p = 0.89)...

Pełny tekst w serwisie zewnętrznym

• #### Why is the cubic structure preferred in newly formed ice?

Publikacja

Molecular dynamics was employed to explain the preference for the cubic structure in newly formed crystals of ice. The results showed that in supercooled liquid water the molecules connected by hydrogen bonds are more likely to adopt relative orientations similar to the ones characteristic for cubic ice. The observed preference for certain relative orientations of molecules in the hydrogen-bonded pairs results in the higher probability...

Pełny tekst w serwisie zewnętrznym

• #### Hat problem on a graph

Publikacja

The topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person 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 win. In this version every...

Pełny tekst w serwisie zewnętrznym

• #### On the hat problem on a graph

Publikacja

The topic of this paper is the hat problem in which each of n players is uniformly and independently 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....

Pełny tekst w serwisie zewnętrznym

• #### Graph security testing

Publikacja

Set S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...

Pełny tekst w serwisie zewnętrznym

• #### Simple adaptive cubic spline interpolation of fluorescence decay functions

Publikacja

Zaproponowano prostą metodę interpolacji funkcji zaniku fluorescencji. W pierwszym kroku interpolowany zanik jest całkowany za pomocą adaptacyjnego algorytmu wykorzystującego kwadratury Newtona-Cotesa. Uzyskiwana w ten spoób siatka wartości czasu jest używana w drugim kroku polegającym na typowej interpolacji za pomocą funkcji sklejanych trzeciego stopnia.

• #### A Family of Pb-based Superconductors with Variable Cubic to Hexagonal Packing

Publikacja

We describe three previously unreported superconductors, BaPb3, Ba0.89Sr0.11Pb3, and Ba0.5Sr0.5Pb3. These three materials, together with SrPb3, form a distinctive isoelectronic family of intermetallic superconductors based on the stacking of Pb planes, with crystal structures that display a hexagonal to cubic perovskite-like progression, as rarely seen in metals. The superconducting transition temperatures (Tc) are similar for...

Pełny tekst w serwisie zewnętrznym

• #### Structural and electrical transport properties of Pr-doped SrTi0.93Co0.07O3-δ a novel SOEC fuel electrode materials

Publikacja

Solid Oxide Electrolyzer Cells (SOECs) are very promising electrochemical devices for the production of syngas (H2/CO) by H2O and CO2 co-electrolysis. The structure, microstructure and electrical properties of the fuel electrode material play a crucial role in the performance of the whole cell and efficiency of electrocatalytic reduction of steam into hydrogen. In the present work, a novel Co and Pr co-doped SrTiO3-δ material attracted...

Pełny tekst w portalu

• #### Koala graph coloring library: an open graph coloring library for real-world applications

Publikacja

- 2008

Pomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....

Pełny tekst w serwisie zewnętrznym

• #### Fast Collaborative Graph Exploration

Publikacja

We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...

Pełny tekst w serwisie zewnętrznym

• #### Zgred - Zgred Graph Editor

Publikacja

- 2014

The paper presents a graph editor that was developed as a supplementary tool for the Koala graph library. We discuss its requirements, design choices and main ideas behind the implementation. The later part of the paper is meant to be a brief user manual, as we go through the functionality provided by the editor

• #### Mixed graph edge coloring

Publikacja

- DISCRETE MATHEMATICS - 2009

W pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.

Pełny tekst w serwisie zewnętrznym

• #### On a Recurrence Arising in Graph Compression

Publikacja

In a recently proposed graphical compression algorithm by Choi and Szpankowski (2012), the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed between two subtrees according to a simple rule: In each step, all balls independently move down to the left subtree (say with probability p) or the right subtree (with probability 1􀀀p). A new node is created as long as...

Pełny tekst w serwisie zewnętrznym

• #### On a Recurrence Arising in Graph Compression

Publikacja

Pełny tekst w serwisie zewnętrznym

Publikacja

- 2007

...

• #### Forwarding and optical indices of a graph

Publikacja

W pracy rozstrzygnięto dwa problemy dotyczące komunikacji wszyscy-do-wszystkich w grafach. Stwierdzono, że dla wersji skierowanej problemu parametry ''pi'' (maksymalne obciążenie krawędzi) i ''w'' (parametr chromatyczny) nie muszą być w ogólności sobie równe. Dla wersji nieskierowanej problemu pokazano, że wyznaczenie wartości zarówno ''pi'', jak i ''w'', jest w ogólności problemem NP-trudnym.

Pełny tekst w serwisie zewnętrznym

• #### Fast collaborative graph exploration

Publikacja

- INFORMATION AND COMPUTATION - 2015

We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...

Pełny tekst w serwisie zewnętrznym

• #### Interval incidence graph coloring

Publikacja

In this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...

Pełny tekst w serwisie zewnętrznym

• #### Parallel scheduling by graph ranking

Publikacja

- 2006

Nr dokum.: 73017Praca dotyczy jednego z nieklasycznych modeli kolorowania grafów - uporządkowanego kolorowania. Celem było uzyskanie wyników, które mogo być wykorzystane w praktycznych zastosowaniach tego modelu, do których należą: równoległe przetwarzanie zapytań w relacyjnych bazach danych, równoległa faktoryzacja macierzy metodą Choleskiego, równoległa asemblacja produktu z jego części składowych. W pracy wskazano uogólnienia...

• #### Composite Bioelectrodes Based on Lipidic Cubic Phase with Carbon Nanotube Network

Publikacja
• E. Nazaruk
• J. Biernat
• J. Rogalski
• R. Bilewicz

- ELECTROANALYSIS - 2009

Elektrody z węgla szklistego modyfikowane fazą kubiczną z siecią nanorurek zastosowano do enzymatycznej redukcji tlenu katalizowanej przez lakazę. Zastosowanie nanorurek obniżyło nadpotencjał redukcji tlenu o 0,5 V. W celu zwiększenia gęstości prądu redukcji tlenu zastosowano znany mediator przeniesienia elektronów - ABTS. Mediator adsorbowano na nanorurkach lub wiązano kowalencyjnie z końcami nanorurek. Kowalencyjne związanie...

Pełny tekst w serwisie zewnętrznym

• #### Status report on high temperature fuel cells in Poland – Recent advances and achievements

Publikacja
• J. Molenda
• J. Kupecki
• R. Baron
• M. Belsznowski
• G. Brus
• T. Brylewski
• M. Bucko
• J. Chmielowiec
• K. Cwieka
• M. Gazda
• A. Gil
• P. Jasiński
• Z. Jaworski
• J. Karczewski
• M. Kawalec
• R. Kluczowski
• M. Krauz
• F. Krok
• B. Lukasik
• M. Małys
• A. Mazur
• A. Mielewczyk-Gryń
• J. Milewski
• S. Molin
• G. Mordalski
• M. Mosiałek
• K. Motyliński
• E. Naumovich
• P. Nowak
• G. Paściak
• P. Pianko-Oprych
• D. Pomykalska
• M. Rękas
• A. Sciazko
• K. Swierczek
• J. Szmyd
• S. Wachowski
• T. Wejrzanowski
• W. Wrobel
• K. Zagórski
• W. Zajac
• A. Zurawska

The paper presents recent advances in Poland in the field of high temperature fuel cells. The achievements in the materials development, manufacturing of advanced cells, new fabrication techniques, modified electrodes and electrolytes and applications are presented. The work of the Polish teams active in the field of solid oxide fuel cells (SOFC) and molten carbonate fuel cell (MCFC) is presented and discussed. The review is oriented...

Pełny tekst w portalu

• #### On the total restrained domination number of a graph

Publikacja

W pracy przedstawione są ograniczenia i własności liczby dominowania podwójnie totalnego.

• #### Distributed graph searching with a sense of direction

Publikacja

In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...

Pełny tekst w serwisie zewnętrznym

• #### A construction for the hat problem on a directed graph

Publikacja

A team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...

Pełny tekst w serwisie zewnętrznym

• #### Graph Decomposition for Memoryless Periodic Exploration

Publikacja

- ALGORITHMICA - 2012

We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...

Pełny tekst w serwisie zewnętrznym