Wyszukiwarka
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: TOTAL CHROMATIC SUM
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
Edge-chromatic sum of trees and bounded cyclicity graphs
Publikacja -
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublikacjaIn 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:...
-
SCIENCE OF THE TOTAL ENVIRONMENT
Czasopisma -
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
T-colorings, divisibility and circular chromatic number
PublikacjaLet 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) =...
-
Note on the variance of the sum of gaussian functonals
PublikacjaDowodzi się oszacowania wariancji sum funkcjonałów losowych, konstruowanych dla zależnego ciągu gaussowskiego.Let (Xi; i = 1; 2; : : :) be a Gaussian sequence with Xi 2 N(0; 1) for each i and suppose its correlation matrix R = (ij)i;j1 is the matrix of some linear operator R : l2 ! l2. Then for fi 2 L 2(), i = 1; 2; : : : ; where is the standard normal distribution, we estimate the variation of the sum of the Gaussian functionals...
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Ciencia Ergo-Sum
Czasopisma -
Sum Coloring of Graphs.
PublikacjaRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Lubricant property and rolling contact fatigue test of oil-in-water emulsion type HFA-E and oil Total Azolla 46 as working liquids in hydraulic systems
PublikacjaW artykule scharakteryzowano i opisano wyniki badań własności smarnych wody destylowanej, emulsji wodno-olejowej typu HFA-E (1% oleju w wodzie) sporządzonej na bazie koncentratu Isosynth VX110BF, oleju Total Azolla 46 i samego koncentratu Isosynth VX110BF (tylko dla porównania z olejem, emulsją i wodą). W artykule pokazano wyniki badań pittingu z użyciem wody, emulsji i oleju jako środków smarnych. Ponadto w artykule przedstawiono...
-
Wnioskowanie o nadmiernym zużyciu energii na podstawie metody sum skumulowanych
PublikacjaW artykule autorka zaprezentowała możliwość wykorzystania metody sum skumulowanych do bieżącego zarządzania energią. Metoda sum skumulowanych wykorzystuje jako wartości porównawcze wskaźniki wyznaczane na podstawie charakterystyk energetycznych procesów. Metoda ma przede wszystkim mieć zastosowanie do wczesnego wykrywania i eliminowania nadmiernego, nieracjonalnego zużycia nośników energii oraz zmian w prowadzonej gospodarce...
-
Chromatic scheduling in a cyclic open shop
PublikacjaPraca jest poświęcona złożoności obliczeniowej problemu cyklicznego szeregowania w systemie otwartym. Autorzy analizując wykazują, że problem jest NP-trudny dla 3 procesorów i konstruują algorytm dokładny dla przypadku dwóch procesorów.Ponadto analizowany jest zwarty wariant cyklicznego systemu otwartego. W tym przypadku autorzy pokazują, że już szeregowanie na dwóch procesorach prowadzi do problemu NP-trudnego.
-
Method of sum of power losses as a way for determining the ki coefficients of energy losses in hydraulic motor
PublikacjaThis paper shows application of the method of sum of power losses to determining energy losses which occur in hydraulic rotary motor in situation when not all laboratory data are at one’s disposal or when no use is made of data contained in catalogue charts. The method makes it possible to determine the coefficients ,ki , of energy losses occurring in the motor. The method of sum of power losses is based on the approach proposed...
-
TOTAL QUALITY MANAGEMENT COPY
Kursy Online -
Minimal Sets of Lefschetz Periods for Morse-Smale Diffeomorphisms of a Connected Sum of g Real Projective Planes
PublikacjaThe dataset titled Database of the minimal sets of Lefschetz periods for Morse-Smale diffeomorphisms of a connected sum of g real projective planes contains all of the values of the topological invariant called the minimal set of Lefschetz periods, computed for Morse-Smale diffeomorphisms of a non-orientable compact surface without boundary of genus g (i.e. a connected sum of g real projective planes), where g varies from 1 to...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublikacjaThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
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.
-
A note on total reinforcement in graphs
PublikacjaIn 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.
-
Total Logistic Management
Czasopisma -
The circular chromatic index of some class 2 graphs
PublikacjaW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Modifications of total synthesis of mycophenolic acid
PublikacjaThe total synthesis of mycophenolic acid (MPA), a potent immunosuppressant, was modified. The obtained mycophenolic acid was suitable for further preparation of new prospective immunosuppressants with improved therapeutic properties.
-
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...
-
Partial dominated schedules and minimizing the total completion time of deteriorating jobs
PublikacjaA problem of scheduling deteriorating jobs on a single processor is considered. The processing time of a job is given by a function pi=ai+bisi, where si is the starting time of the job, ai>=0, bi>=0, for i=1,...,n. Jobs are non-preemptive and independent and there are neither ready times nor deadlines. The goal is to minimize the total weighted completion time. We show how to employ the concept of non-dominated schedules to construct...
-
TOTAL QUALITY MANAGEMENT 23/24
Kursy Online -
TOTAL QUALITY MANAGEMENT 24/25
Kursy Online -
TOTAL SHIP OPERABILITY – REVIEW, CONCEPT AND CRITERIA
PublikacjaThe ship operability can be understood and analysed in different manners, and its quality is described using different indexes by different authors. Practically, there is no general and widely accepted description of total ship operability in the literature, nor in the rules of classification societies, which would include both seakeeping and manoeuvrability characteristics of a ship, and simultaneously take into account all ship...
-
Sum Coloring of Bipartite Graphs with Bounded Degree
Publikacja -
Sum of Effective Temperatures in Colorado Beetle Control
Publikacja -
Weighted-Sum Approach to Health Care Optimization
Publikacja -
Sum coloring of bipartite graphs with bounded degree.
PublikacjaArtykuł poświęcony jest złożoności obliczeniowej zagadnienia sumacyjnego kolorowania grafów dwudzielnych o ograniczonym stopniu. Zawiera dowód tego, że sumacyjne kolorowanie grafów dwudzielnych stopnia mniejszego równego 5 jest NP-zupełne oraz opis wielomianowego algorytmu, który optymalnie sumacyjnie koloruje grafy dwudzielne podkubiczne.
-
SOME CONVERGENCE PROPERTIES OF THE SUM OF GAUSSIAN FUNCTIONALS
PublikacjaIn the paper, some aspects of the convergence of series of dependent Gaussian sequences problem are solved. The necessary and sufficient conditions for the convergence of series of centered dependent indicators are obtained. Some strong convergence results for weighted sums of Gaussian functionals are discussed.
-
On trees attaining an upper bound on the total domination number
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
A note on the strength and minimum color sum of bipartite graphs
PublikacjaSiłą grafu G nazywamy najmniejszą liczbę całkowitą s, taką że istniej pokolorowanie grafu G, o minimalnej sumie przy użyciu kolorów {1,...,s}. W pracy pokazano, że w grafach dwudzielnych stopnia D zachodzi oszacowanie s <= ceil(D/2) + 1. Z obserwacji tej wynika algorytm wielomianowy do obliczania siły i sumy chromatycznej w grafach dwudzielnych stopnia co najwyżej 4.
-
Total domination in versus paired-domination in regular graphs
PublikacjaA 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...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
The dynamics of total outputs of Indonesian industrial sectors: A further study
PublikacjaThe purpose of the current study is to extend the previous studies which analyze the impacts of final demands modifications on the total outputs of industrial sectors of a particular country. More specifically, the study conducts the analysis regarding the impacts on the total outputs of Indonesian industrial sectors. The study employs a demand pull Input-Output (IO) quantity model, one of the calculation instruments in the IO...
-
The dynamics of total outputs of Indonesian industrial sectors: A further study
PublikacjaThe purpose of the current study is to extend the previous studies which analyze the impacts of final demands modifications on the total outputs of industrial sectors of a particular country. More specifically, the study conducts the analysis regarding the impacts on the total outputs of Indonesian industrial sectors. The study employs a demand-pull Input-Output (IO) quantity model, one of the calculation instruments in the IO...
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Photogrammetric and total station's measurement of compressed column's model
PublikacjaModelling studies continue to play an important role. One of such study is stress determination in the reinforcement bars of reinforced columns and determine column's axis deformation. The article presents measurements results of control points located on the model of reinforced concrete column. The column was compressed in few series till it's destruction. In this studies, photogrammetric method and total station measurements...
-
How to evaluate methods used in chemical laboratories in terms of the total chemical risk? – a ChlorTox Scale
PublikacjaReliable assessment of the health and environmental risk associated with the use of chemicals is critical to ob- jectively evaluate the greenness and whiteness of an analytical method. An objective and useful way of risk assessment should take into account all the relevant properties of used substances, their actual amounts needed for application of the method, and quantify the assessment result using a standardized unit. This...
-
Sum-over-state expressions including second-order Herzberg–Teller effects for the calculation of absorption and resonance Raman intensities
PublikacjaThe sum-over-state expressions are derived to calculate the second-order Herzberg–Teller (HT) effects in absorption and resonance Raman spectroscopies. These effects depend on the second derivatives of the transition dipole moment with respect to the vibrational coordinates. The method is applied to the molecule of 1,3-butadiene using density functional theory calculations. It is found that the second-order HT effects are significant...
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublikacjaThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...
-
The dynamics of the total output of the fishery sector: The case of Indonesia
PublikacjaThe purpose of this study is to analyze the dynamics of the total output of the Indonesian fishery industry when the changes of the final demand occur. This study employs a demand-pull Input-Output (IO) quantity model, one of the calculation tools in the IO analysis, as an analysis instrument. Two conditions are noticed in calculation and analysis parts, namely (1) “whole sector change”, and (2) “pure change”. An initial period...