Wyniki wyszukiwania dla: G RA ETZ NUMBER - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: G RA ETZ NUMBER

Wyniki wyszukiwania dla: G RA ETZ NUMBER

  • Mariusz Kaczmarek dr hab. inż.

    Received M.Sc., Eng. in Electronics in 1995 from Gdansk University of Technology, Ph.D. in Medical Electronics in 2003 and habilitation in Biocybernetics and Biomedical Engineering in 2017. He was an investigator in about 13 projects receiving a number of awards, including four best papers, practical innovations (7 medals and awards) and also the Andronicos G. Kantsios Award and Siemens Award. Main research activities: the issues...

  • Experimental Investigation of Free Convection Heat Transfer from Horizontal Cylinder to Nanofluids

    Publikacja

    - ENERGIES - Rok 2021

    The results of free convection heat transfer investigation from a horizontal, uniformly heated tube immersed in a nanofluid are presented. Experiments were performed with five base fluids, i.e., ethylene glycol (EG), distilled water (W) and the mixtures of EG and water with the ratios of 60/40, 50/50, 40/60 by volume, so the Rayleigh (Ra) number range was 3 104 Ra 1.3 106 and the Prandtl (Pr) number varied from 4.4 to 176....

    Pełny tekst do pobrania w portalu

  • Rapid Design of 3D Reflectarray Antennas by Inverse Surrogate Modeling and Regularization

    Publikacja

    - IEEE Access - Rok 2023

    Reflectarrays (RAs) exhibit important advantages over conventional antenna arrays, especially in terms of realizing pencil-beam patterns without the employment of the feeding networks. Unfortunately, microstrip RA implementations feature narrow bandwidths, and are severely affected by losses. A considerably improved performance can be achieved for RAs involving grounded dielectric layers, which are also easy to manufacture using...

    Pełny tekst do pobrania w portalu

  • Effect of Temperature and Nanoparticle Concentration on Free Convective Heat Transfer of Nanofluids

    Publikacja

    - ENERGIES - Rok 2021

    A theoretical analysis of the influence of temperature and nanoparticle concentration on free convection heat transfer from a horizontal tube immersed in an unbounded nanofluid was presented. The Nusselt (Nu) number and heat transfer coefficient were parameters of the intensity of the convective heat transfer. For free convection, the Nu number was a function of the Rayleigh (Ra) number and Prandtl (Pr) number. The Rayleigh (Ra)...

    Pełny tekst do pobrania w portalu

  • THREE-DIMENSIONAL numerical investigation of MHD nanofluid convective heat transfer inside a CUBIC porous container with corrugated bottom wall

    Publikacja

    - Rok 2022

    Simultaneous use of porous media and nanofluid as a heat transfer improvement method has recently captivated a great deal of attention. The heat transfer and entropy production of the Cu-water nanofluid inside a cubic container with a heated bottom wavy wall and an elliptic inner cylinder were numerically analyzed in this study. The container is partitioned into two sections: the left side is filled with permeable media and...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Domination subdivision and domination multisubdivision numbers of graphs

    The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...

    Pełny tekst do pobrania w portalu

  • Total Domination Versus Domination in Cubic Graphs

    Publikacja

    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 do pobrania w portalu

  • TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH

    Publikacja

    - Discussiones Mathematicae Graph Theory - Rok 2015

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

    Pełny tekst do pobrania w portalu

  • Common Independence in Graphs

    Publikacja

    - Symmetry-Basel - Rok 2021

    Abstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...

    Pełny tekst do pobrania w portalu

  • Ocena odporności na zużycie ścierne stopów Ti na elementy pary trącej endoprotez stawu kolanowego

    Najczęściej stosowanym biomateriałem tytanowym na elementy endoprotez stawu kolanowego jest stop Ti6Al4V. Z uwagi na zawartość wanadu, zaliczanego do pierwiastków o dużej toksyczności podejmowane są działania w kierunku zastąpienia wskazanego stopu - stopami bezwanadowymi. Jednym z najbardziej obiecujących jest stop Ti13Nb13Zr zawierający w swoim składzie jedynie pierwiastki witalne, niewywołujące stanów zapalnych i odczynów...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Bondage number of grid graphs

    Publikacja

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

    Pełny tekst do pobrania w portalu

  • Some Progress on Total Bondage in Graphs

    Publikacja

    - GRAPHS AND COMBINATORICS - Rok 2014

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Minimum order of graphs with given coloring parameters

    Publikacja

    - DISCRETE MATHEMATICS - Rok 2015

    A complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Independent Domination Subdivision in Graphs

    Publikacja

    - GRAPHS AND COMBINATORICS - Rok 2021

    A set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...

    Pełny tekst do pobrania w portalu

  • On trees with double domination number equal to 2-outer-independent domination number plus one

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Paired domination subdivision and multisubdivision numbers of graphs

    The paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...

    Pełny tekst do pobrania w portalu

  • Weakly convex domination subdivision number of a graph

    Publikacja

    - FILOMAT - Rok 2016

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

    Pełny tekst do pobrania w portalu

  • 2-bondage in graphs

    A 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On trees with double domination number equal to total domination number plus one

    Publikacja

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Block graphs with large paired domination multisubdivision number

    Publikacja

    The paired domination multisubdivision number of a nonempty graph G, denoted by msdpr(G), is the smallest positive integer k such that there exists an edge which must be subdivided k times to increase the paired domination number of G. It is known that msdpr(G) ≤ 4 for all graphs G. We characterize block graphs with msdpr(G) = 4.

    Pełny tekst do pobrania w portalu

  • Graphs with isolation number equal to one third of the order

    Publikacja

    - DISCRETE MATHEMATICS - Rok 2024

    A set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs

    Publikacja

    - Opuscula Mathematica - Rok 2016

    Given a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...

    Pełny tekst do pobrania w portalu

  • On trees with double domination number equal to 2-domination number plus one

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The convex domination subdivision number of a graph

    Publikacja

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

    Pełny tekst do pobrania w portalu

  • Parity vertex colouring of graphs

    Publikacja

    - Discussiones Mathematicae Graph Theory - Rok 2011

    A parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...

    Pełny tekst do pobrania w portalu

  • On trees attaining an upper bound on the total domination number

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number

    Publikacja

    Given 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,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On the double bondage in graphs

    Publikacja

    A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) 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, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...

  • 2-outer-independent domination in graphs

    Publikacja

    We initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • New potential functions for greedy independence and coloring

    Publikacja

    - DISCRETE APPLIED MATHEMATICS - Rok 2015

    A potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...

    Pełny tekst do pobrania w portalu

  • Non-isolating bondage in graphs

    A dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Non-isolating 2-bondage in graphs

    A 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On Tradeoffs Between Width- and Fill-like Graph Parameters

    In this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...

    Pełny tekst do pobrania w portalu

  • Unicyclic graphs with equal total and total outer-connected domination numbers

    Publikacja

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Experimental investigations on heat transfer enhancement in shell coil heat exchanger with VARIABLE Baffles GEOMETRY

    The paper presents the possibility of using passive intensification of heat transfer in the form of baffles to increase the energy efficiency of the shell and coil heat exchanger. The experiment was carried out by using a modular coil heat exchanger in the form of an electric heater. Water was used as a working fluid with constant thermal-flow parameters at the inlet of the module. It should be noted that experiments were made...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Chemical variability of Rhododendron tomentosum (Ledum palustre) essential oils and their pro-apoptotic effect on lymphocytes and rheumatoid arthritis synoviocytes

    Publikacja
    • A. Jesionek
    • A. Kokotkiewicz
    • A. Mikosik-Roczynska
    • K. Ciesielska-Figlon
    • P. Luczkiewicz
    • A. Bucinski
    • A. Daca
    • J. M. Witkowski
    • E. Bryl
    • B. Zabiegała
    • M. Luczkiewicz

    - FITOTERAPIA - Rok 2019

    Rhododendron tomentosum (Ledum palustre) is an aromatic plant traditionally used for alleviating rheumatic complaints which makes it a potential candidate for a natural drug in rheumatoid arthritis (RA) treatment. However, the effects of plants’ volatiles on apoptosis of synovial fibroblasts and infiltrating leucocytes of RA synovia, have not been reported. Volatile fraction of R. tomentosum is chemically variable and chemotypes...

    Pełny tekst do pobrania w portalu

  • Total domination in versus paired-domination in regular graphs

    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 do pobrania w portalu

  • Strategic balance in graphs

    For a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Influence of edge subdivision on the convex domination number

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Isolation Number versus Domination Number of Trees

    Publikacja
    • M. Lemańska
    • M. J. Souto-Salorio
    • A. Dapena
    • F. Vazquez-Araujo

    - Mathematics - Rok 2021

    If 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)....

    Pełny tekst do pobrania w portalu

  • An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree

    A 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Bipartite theory of graphs: outer-independent domination

    Publikacja

    - NATIONAL ACADEMY SCIENCE LETTERS-INDIA - Rok 2015

    Let $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Weakly convex and convex domination numbers of some products of graphs

    If $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...

  • Coronas and Domination Subdivision Number of a Graph

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

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The Potential of Greed for Independence

    Publikacja

    - JOURNAL OF GRAPH THEORY - Rok 2012

    The well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On the super domination number of lexicographic product graphs

    Publikacja

    - DISCRETE APPLIED MATHEMATICS - Rok 2019

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

    Pełny tekst do pobrania w portalu

  • T-colorings, divisibility and circular chromatic number

    Let 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) =...

    Pełny tekst do pobrania w portalu

  • On the differential effect of temperature on the Nusselt-Rayleigh relationship in free convection

    Publikacja

    The aim of and inspiration behind this paper was to explain the reasons, also observed by other researchers, of the discrepancy in the results of experimental free convection, which for small Rayleigh and Nusselt numbers in the initial phase of research can sometimes reach several hundred percent. These discrepancies decrease with increasing heating power and plate surface temperature, in proportion to the increase in Ra and Nu,...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Equitable coloring of corona products of graphs

    Publikacja
    • H. Furmańczyk
    • K. Kaliraj
    • M. Kubale
    • J. Vernold Vivin

    - Advances and Applications in Discrete Mathematics - Rok 2013

    In this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • On the ratio between 2-domination and total outer-independent domination numbers of trees

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

    Pełny tekst do pobrania w serwisie zewnętrznym