Search
Filters
total: 4418
-
Catalog
displaying 1000 best results Help
Search results for: RICHARDSON NUMBER
-
DO WE NEED NAVIER NUMBER? – FURTHER REMARKS AND COMPARISON WITH ANOTHER DIMENSIONLESS NUMBERS
PublicationThis paper presents a role of the Navier number (Na-dimensionless slip-length) in universal modelling of flow reported in micro- and nano-channels like: capillary biological flows, fuel cell systems, micro-electro-mechanical systems and nano-electro-mechanical systems. Similar to another bulk-like and surface-like dimensionless numbers, the Na number should be treated as a ratio of internal viscous to external viscous momentum...
-
Small-signal admittance for Schottky-Richardson emission into an organic layer
PublicationPraca przedstawia małosygnalową admitancję emisji Schottky'ego-Richardsona do warstwy organicznej. Analiza obejmuje obie składowe zespolonej odpowiedzi.
-
Pipelined division of signed numbers with the use of residue arithmetic for small number range with the programmable gate array
PublicationIn this work an architecture of the pipelined signed residue divider for the small number range is presented. Its operation is based on reciprocal calculation and multiplication by the dividend. The divisor in the signed binary form is used to compute the approximated reciprocal in the residue form by the table look-up. In order to limit the look-up table address an algorithm based on segmentation of the divisor into two segments...
-
Minimization of the number of periodic points for smooth self-maps of simply-connected manifolds with periodic sequence of Lefschetz numbers
PublicationLet f be a smooth self-map of m-dimensional, m ≥ 4, smooth closed connected and simply-connected manifold, r a fixed natural number. For the class of maps with periodic sequence of Lefschetz numbers of iterations the authors introduced in [Graff G., Kaczkowska A., Reducing the number of periodic points in smooth homotopy class of self-maps of simply-connected manifolds with periodic sequence of Lefschetz numbers, Ann. Polon. Math....
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
Numeryczne rozwiązania jednowymiarowego równania Richardsa
PublicationCelem niniejszego artykułu jest przegląd i ocena właściwości metod numerycznych stosowanych do rozwiązywania jednowymiarowego równania przepływu w strefie nienasyconej gruntu. Wykonane obliczenia i testy numeryczne pozwoliły na sformułowanie kilku spostrzeżeń dotyczących praktycznego zastosowania znanych algorytmów.
-
Writing in Richardson variant of progressive supranuclear palsy in comparison to progressive non-fluent aphasia
Publication -
Research in Number Theory
Journals -
Algebra & Number Theory
Journals -
JOURNAL OF NUMBER THEORY
Journals -
DETERMINATION OF THE HYDROXYL NUMBER OF GROUND TIRE RUBBER PARTICLES VIA MODIFIED TEST METHOD FOR ISOCYANATE GROUPS
PublicationNowadays, considering the environmental trends and law regulations associated with the circular economy, it is very important to seek for the methods of by-products and waste utilization. The example of such material, which requires the attention and recycling method is ground tire rubber generated during recycling of post-consumer car tires. It can be introduced into various polymer matrices as a filler, but to enhance its effectivity...
-
Reducing the number of periodic points in the smooth homotopy class of a self-map of a simply-connected manifold with periodic sequence of Lefschetz numbers
PublicationLet f be a smooth self-map of an m-dimensional (m >3) closed connected and simply-connected manifold such that the sequence of the Lefschetz num- bers of its iterations is periodic. For a fixed natural r we wish to minimize, in the smooth homotopy class, the number of periodic points with periods less than or equal to r. The resulting number is given by a topological invariant J[f] which is defned in combinatorial terms and is...
-
Utility of Frontal Assessment Battery in detection of neuropsychological dysfunction in Richardson variant of progressive supranuclear palsy
Publication -
The pattern of verbal, visuospatial and procedural learning in Richardson variant of progressive supranuclear palsy in comparison to Parkinson’s disease
Publication -
On trees with double domination number equal to 2-domination number plus one
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
On trees with double domination number equal to total domination number plus one
PublicationA 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,...
-
Communications in Number Theory and Physics
Journals -
International Journal of Number Theory
Journals -
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA 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...
-
Bounds on isolated scattering number
PublicationThe 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
PublicationThe 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.
-
Bondage number of grid graphs
PublicationThe 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
Publication2-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...
-
Navier number and transition to turbulence
PublicationThe 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 trees with double domination number equal to 2-outer-independent domination number plus one
PublicationA 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...
-
Self-Tuning Dead-Time Compensation Method for Voltage-Source Inverters
PublicationPrzedstawiono nową, kompleksową metodę kompensacji zniekształceń napięcia wyjściowego falownika z modulacją szerokości impulsów. Proponowana metoda umożliwia automatyczne dopasowanie parametrów charakterystyki kompensacyjnej do aktualnej konfiguracji falownika i obciążenia, np. po zmianie przewodu łączącego falownik z obciążeniem. Adaptacja do nowych warunków polega na dostrajaniu wartości parametrów zależności opisującej napięcie...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublicationGiven 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,...
-
On domination multisubdivision number of unicyclic graphs
PublicationThe 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...
-
The outer-connected domination number of a graph
PublicationW pracy została zdefiniowana liczba dominowania zewnętrznie spójnego i przedstawiono jej podstawowe własności.
-
On the total restrained domination number of a graph
PublicationW pracy przedstawione są ograniczenia i własności liczby dominowania podwójnie totalnego.
-
Lower bound on the domination number of a tree.
PublicationW pracy przedstawiono dolne ograniczenie na liczbę dominowania w drzewach oraz przedstawiono pełną charakterystykę grafów ekstremalnych.
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
On the doubly connected domination number of a graph
PublicationW pracy została zdefiniowana liczba dominowania podwójnie spójnego i przedstawiono jej podstawowe własności.
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublicationThe 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...
-
Coronas and Domination Subdivision Number of a Graph
PublicationIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
The convex domination subdivision number of a graph
PublicationLet 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...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublicationThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Notes on Number Theory and Discrete Mathematics
Journals -
Moscow Journal of Combinatorics and Number Theory
Journals -
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Non-standard binary weighted number systems
PublicationZdefiniowano szeroką klasę binarnych systemów wagowych. Wszystkie sa wzajemnie jednoznaczne ale mogą być zupełne lub niezupełne. Jeżeli wagi systemu są kolejnymi liczbami naturalnymi to system jest minimalny.Jesli wagi sa kolejnymi potęgami podstawy Z to system jest maksymalny. W przestrzeni między tymi systemami znajdują się inne systemy binarne. Kilka z nich przedstawiono w referacie.
-
Empirical Probability Distributions with Unknown Number of Components
Publication -
Lower bound on the paired domination number of a tree
PublicationW pracy przedstawione jest ograniczenie dolne dla liczby dominowania parami oraz scharakteryzowane są wszystkie drzewa ekstremalne.
-
Graphs with convex domination number close to their order
PublicationW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
T-colorings, divisibility and circular chromatic number
PublicationLet 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) =...
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Entanglement and Nonlocality are Inequivalent for Any Number of Parties
PublicationUnderstanding the relation between nonlocality and entanglement is one of the fundamental problems in quantum physics. In the bipartite case, it is known that these two phenomena are inequivalent, as there exist entangled states of two parties that do not violate any Bell inequality. However, except for a single example of an entangled three-qubit state that has a local model, almost nothing is known about such a relation in multipartite...
-
Influence of edge subdivision on the convex domination number
PublicationWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Weakly convex domination subdivision number of a graph
PublicationA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Polyhedral Ramsey Numbers
PublicationGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...