Wyszukiwarka
Filtry
wszystkich: 4303
-
Katalog
- Publikacje 3026 wyników po odfiltrowaniu
- Czasopisma 15 wyników po odfiltrowaniu
- Konferencje 2 wyników po odfiltrowaniu
- Osoby 48 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Kursy Online 136 wyników po odfiltrowaniu
- Wydarzenia 32 wyników po odfiltrowaniu
- Dane Badawcze 1042 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: on-line ramsey number
-
Bondage number of grid graphs
PublikacjaThe 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.
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Navier number and transition to turbulence
PublikacjaThe motivation behind this article is to explain a role of the Navier number (Na -dimensionless slip-length) in prediction of closures for laminar to turbulent transition undergoing via eddies detachment from the slip layer in nano-cannals. Additionally the role of the Navier number Na in universal modeling of phenomenon of enhanced mass flow rate reported in micro- and nano-channels has been explained. The Na number should be...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Arsalan Muhammad Soomar Doctoral Student
OsobyHi, I'm Arsalan Muhammad Soomar, an Electrical Engineer. I received my Master's and Bachelor's Degree in the field of Electrical Engineering from Mehran University of Engineering and Technology, Jamshoro, Sindh, Pakistan. Currently enrolled as a Doctoral student at the Gdansk University of Technology, Gdansk, Poland. Also worked in Yellowlite. INC, Ohio as a Solar Design Engineer. HEADLINE Currently Enrolled as a Doctoral...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA 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 double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Wpływ usług on-line na budowanie pozytywnych relacji i lojalności klienta
PublikacjaW artykule omówiono wybrane problemy projektowe dotyczące współczesnych usług on-line w kontekście budowania trwałej lojalności klienta. Przedstawiono model warstwowego rozwoju usług on-line wraz z zaleceniami projektowymi zorientowanymi na budowanie i wzmacnianie lojalności klienta. Przedstawiono przykłady scenariuszy rozwoju usług e-zdrowia online. Przedstawiono możliwości dalszego rozwoju prezentowanego podejścia i plany dalszych...
-
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...
-
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 variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Mikroekonomia nst msu_on-line
Kursy OnlinePodstawy mikroekonomii dla msu 4. sem. - 2h zajęć prowadzi w formule on-line dr Aniela Mikulska.
-
On-line measurement of wood surface smoothness
PublikacjaThe latest progress in the field of optics and microelectronics resulted in development of new generation vision systems capable of scanning surface topography with very high sampling frequencies. The blue color of illuminating light as well as novel systems for controlling ultra-thin laser line thickness allows measurement of the porous surface of wood with a triangulation method. Three alternative sensors were tested here in...
-
Towards the value-based design of on-line services
PublikacjaThe paper identifies economic factors shaping customer bahaviour in on-line services in two interrelated dimensions; (1) economic needs and requirements, relevant to expected benefits and values perceived by customers; (2) technical components, allowing technical realization of on-line services. Technical components were cathegorized into four groups, creating so-called VIPR model: Visual, Interactive, Process and Relationship-relevant...
-
Mikroekonomia nst ZI_on-line
Kursy OnlineZajęcia prowadzone on-line na 2 semestrze kierunku ZI, 2h wykładu i 2h ćwiczeń przez ms teams prowadzi dr Aniela Mikulska.
-
Monitoring of current collectors on the railway line
PublikacjaProper cooperation the current collectors and the overhead line is a pre-requisite for reliable and safe operation of railway transport. Instances of maladjustment and, in some cases, damage to the current collectors, occur between periodic inspections of the rolling stock. In order to detect such anomalies quickly, the test stand was developed, with the aim of monitoring the technical state of the current collectors under operating...
-
Image Processing On Line
Czasopisma -
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...