Filtry
wszystkich: 515
-
Katalog
Wyniki wyszukiwania dla: CUBIC%20GRAPH
-
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublikacjaW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
Cubic Journal
Czasopisma -
Total Domination Versus Domination in Cubic Graphs
PublikacjaA 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...
-
On bipartization of cubic graphs by removal of an independent set
PublikacjaWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
The electronic characterization of the cubic Laves-phase superconductor CaRh2
PublikacjaWe 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)...
-
Why is the cubic structure preferred in newly formed ice?
PublikacjaMolecular 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...
-
Discussiones Mathematicae Graph Theory
Czasopisma -
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.
-
Simple adaptive cubic spline interpolation of fluorescence decay functions
PublikacjaZaproponowano 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.
-
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.
-
A Family of Pb-based Superconductors with Variable Cubic to Hexagonal Packing
PublikacjaWe 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...
-
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.
-
Composite Bioelectrodes Based on Lipidic Cubic Phase with Carbon Nanotube Network
PublikacjaElektrody 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...
-
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.
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publikacja -
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...
-
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.
-
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...
-
Luminescence enhancement in nanocrystalline Eu2O3 nanorods – Microwave hydrothermal crystallization and thermal degradation of cubic phase
Publikacja -
MEMORY EFFECT ANALYSIS USING PIECEWISE CUBIC B-SPLINE OF TIME FRACTIONAL DIFFUSION EQUATION
PublikacjaThe purpose of this work is to study the memory effect analysis of Caputo–Fabrizio time fractional diffusion equation by means of cubic B-spline functions. The Caputo–Fabrizio interpretation of fractional derivative involves a non-singular kernel that permits to describe some class of material heterogeneities and the effect of memory more effectively. The proposed numerical technique relies on finite difference approach and cubic...