Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "labeling" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-100 z 118
Tytuł:
Value sets of graphs edge-weighted with elements of a finite abelian group
Autorzy:
DuCasse, Edgar
Gargano, Michael
Quintas, Louis
Powiązania:
https://bibliotekanauki.pl/articles/744500.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
edge labeling
vertex labeling
abelian group
Opis:
Given a graph G = (V,E) of order n and a finite abelian group H = (H,+) of order n, a bijection f of V onto H is called a vertex H-labeling of G. Let g(e) ≡ (f(u)+f(v)) mod H for each edge e = {u,v} in E induce an edge H-labeling of G. Then, the sum $Hval_f(G) ≡ ∑_{e ∈ E} g(e) mod H$ is called the H-value of G relative to f and the set HvalS(G) of all H-values of G over all possible vertex H-labelings is called the H-value set of G. Theorems determining HvalS(G) for given H and G are obtained.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 1; 5-15
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Labeling of 2-regular graphs by even edge magic
Autorzy:
Gunasekaran, D.
Senbagam, K.
Saranya, R.
Powiązania:
https://bibliotekanauki.pl/articles/1065240.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Labeling
Magic Labeling
edge magic total labeling
even edge magic total labeling
Opis:
In this paper we introduced the new notion of an even edge magic total labeling of some -regular graphs. An edge magic total labeling of a graph is said to be an even edge magic total labeling if with the condition that for each edg , where is said to be magic constant. We determined cycles of odd length, disjoint union of cycles of length for and are odd, disjoint union , disjoint union , disjoint union and disjoint union are even edge magic total labeling.
Źródło:
World Scientific News; 2019, 135; 32-47
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees
Autorzy:
Kubesa, Michael
Powiązania:
https://bibliotekanauki.pl/articles/744369.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph decomposition and factorization
graph labeling
α-labeling
flexible q-labeling
α-like labeling
Opis:
We examine constructions of non-symmetric trees with a flexible q-labeling or an α-like labeling, which allow factorization of $K_{2n}$ into spanning trees, arising from the trees with α-labelings.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 311-324
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On γ-labelings of trees
Autorzy:
Chartrand, Gary
Erwin, David
VanderJagt, Donald
Zhang, Ping
Powiązania:
https://bibliotekanauki.pl/articles/744388.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
γ-labeling
value of a γ-labeling
Opis:
Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f:V(G) → {0,1,2,...,m} that induces a labeling f': E(G) → {1,2,...,m} of the edges of G defined by f'(e) = |f(u)-f(v)| for each edge e = uv of G. The value of a γ-labeling f is $val(f) = Σ_{e ∈ E(G)}f'K(e)$. The maximum value of a γ-labeling of G is defined as
$val_{max}(G) = max {val(f) : f is a γ- labeling of G}$;
while the minimum value of a γ-labeling of G is
$val_{min}(G) = min {val(f) : f is a γ- labeling of G}$;
The values $val_{max}(S_{p,q})$ and $val_{min}(S_{p,q})$ are determined for double stars $S_{p,q}$. We present characterizations of connected graphs G of order n for which $val_{min}(G) = n$ or $val_{min}(G) = n+1$.
Źródło:
Discussiones Mathematicae Graph Theory; 2005, 25, 3; 363-383
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Survey of certain valuations of graphs
Autorzy:
Bača, Martin
MacDougall, J.
Miller, Mirka
Slamin, ---
Wallis, W.
Powiązania:
https://bibliotekanauki.pl/articles/972036.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
(a,d)-antimagic labeling
(a,d)-face antimagic labeling
edge-magic total labeling
vertex-magic total labeling
Opis:
The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.
Źródło:
Discussiones Mathematicae Graph Theory; 2000, 20, 2; 219-229
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Supermagic Graphs with Many Different Degrees
Autorzy:
Kovář, Petr
Kravčenko, Michal
Silber, Adam
Krbeček, Matěj
Powiązania:
https://bibliotekanauki.pl/articles/32324150.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
supermagic labeling
non-regular graphs
Opis:
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f from the set of edges E to a set of consecutive integers {a, a + 1, . . ., a + e − 1} such that for every vertex v ∈ V the sum of labels of all adjacent edges equals the same constant k. This k is called a magic constant of f, and G is a supermagic graph. The existence of supermagic labeling for certain classes of graphs has been the scope of many papers. For a comprehensive overview see Gallian’s Dynamic survey of graph labeling in the Electronic Journal of Combinatorics. So far, regular or almost regular graphs have been studied. This is natural, since the same magic constant has to be achieved both at vertices of high degree as well as at vertices of low degree, while the labels are distinct consecutive integers.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1041-1050
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some totally modular cordial graphs
Autorzy:
Cahit, Ibrahim
Powiązania:
https://bibliotekanauki.pl/articles/743356.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
cordial labeling
magic and sequential graphs
Opis:
In this paper we define total magic cordial (TMC) and total sequential cordial (TSC) labellings which are weaker versions of magic and simply sequential labellings of graphs. Based on these definitions we have given several results on TMC and TSC graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2002, 22, 2; 247-258
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Vertex-antimagic total labelings of graphs
Autorzy:
Bača, Martin
MacDougall, James
Bertault, François
Miller, Mirka
Simanjuntak, Rinovia
Slamin, ---
Powiązania:
https://bibliotekanauki.pl/articles/972037.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
super-magic labeling
(a,d)-vertex-antimagic total labeling
(a,d)-antimagic labeling
Opis:
In this paper we introduce a new type of graph labeling for a graph G(V,E) called an (a,d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V|+|E| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its incident edges. These sums form an arithmetical progression with initial term a and common difference d.
We investigate basic properties of these labelings, show their relationships with several other previously studied graph labelings, and show how to construct labelings for certain families of graphs. We conclude with several open problems suitable for further research.
Źródło:
Discussiones Mathematicae Graph Theory; 2003, 23, 1; 67-83
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluation of the effects of antibiotics on cytotoxicity of EGFP and DsRed2 fluorescent proteins used for stable cell labeling
Autorzy:
Zakrzewska, Karolina
Samluk, Anna
Pluta, Krzysztof
Pijanowska, Dorota
Powiązania:
https://bibliotekanauki.pl/articles/1039220.pdf
Data publikacji:
2014
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
stable fluorescent labeling
whole-cell labeling
fluorescent protein cytotoxicity
Opis:
The use of fluorescent markers has proven to be an attractive tool in biological imaging. However, its usefulness may be confined by the cytotoxicity of the fluorescent proteins. In this article, for the first time, we have examined an influence of the antibiotics present in culture medium on cytotoxicity of the EGFP and DsRed2 markers used for whole-cell labeling. Results showed that doxycycline negatively affected albumin synthesis in DsRed2-expressing hepatoma cells, and that both hepatoma cells and human skin fibroblasts, labeled with this protein, were characterized by the lowered growth rates. Thus, the cytotoxic effect of fluorescent markers depends on both protein used for cell labeling and on growth conditions that may cause cell stress.
Źródło:
Acta Biochimica Polonica; 2014, 61, 4; 809-813
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on incomplete regular tournaments with handicap two of order n ≡8 (mod 16)
Autorzy:
Froncek, D.
Powiązania:
https://bibliotekanauki.pl/articles/255455.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
incomplete tournaments
handicap tournaments
distance magic labeling
handicap labeling
Opis:
A d-handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection ƒ : V → 1, 2,..., n } with the property that ƒ(xi) = i and the sequence of weights w(x1), w(x2),... , w(xn) (where [formula] ) forms an increasing arithmetic progression with common difference d. A graph G is a d-handicap distance antimagic graph if it allows a d-handicap distance antimagic labeling. We construct a class of k-regular 2-handicap distance antimagic graphs for every order n ≡8 (mod 16), n ≥56 and 6 ≥ k ≥ n — 50.
Źródło:
Opuscula Mathematica; 2017, 37, 4; 557-566
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Trees Whose Even-Degree Vertices Induce a Path are Antimagic
Autorzy:
Lozano, Antoni
Mora, Mercè
Seara, Carlos
Tey, Joaquín
Powiązania:
https://bibliotekanauki.pl/articles/32304141.pdf
Data publikacji:
2022-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
antimagic labeling
tree
Opis:
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . ., |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to v. A graph is called antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel conjectured that every simple connected graph other than K2 is antimagic; however the conjecture remains open, even for trees. In this note we prove that trees whose vertices of even degree induce a path are antimagic, extending a result given by Liang, Wong, and Zhu [Anti-magic labeling of trees, Discrete Math. 331 (2014) 9–14].
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 3; 959-966
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On total vertex irregularity strength of graphs
Autorzy:
Muthu Guru Packiam, K.
Kathiresan, Kumarappan
Powiązania:
https://bibliotekanauki.pl/articles/743655.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
irregularity strength
total assignment
vertex irregular total labeling
Opis:
Martin Bača et al. [2] introduced the problem of determining the total vertex irregularity strengths of graphs. In this paper we discuss how the addition of new edge affect the total vertex irregularity strength.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 1; 39-45
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Arithmetic labelings and geometric labelings of countable graphs
Autorzy:
Vijayakumar, Gurusamy
Powiązania:
https://bibliotekanauki.pl/articles/744063.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
arithmetic labeling of a graph
geometric labeling of a graph
Opis:
An injective map from the vertex set of a graph G-its order may not be finite-to the set of all natural numbers is called an arithmetic (a geometric) labeling of G if the map from the edge set which assigns to each edge the sum (product) of the numbers assigned to its ends by the former map, is injective and the range of the latter map forms an arithmetic (a geometric) progression. A graph is called arithmetic (geometric) if it admits an arithmetic (a geometric) labeling. In this article, we show that the two notions just mentioned are equivalent-i.e., a graph is arithmetic if and only if it is geometric.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 4; 539-544
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the structure of path-like trees
Autorzy:
Muntaner-Batle, F.
Rius-Font, Miquel
Powiązania:
https://bibliotekanauki.pl/articles/743315.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
tree
path-like tree
Tₚ-tree
expandable tree
α-valuation
super edge-magic labeling
special super edge-magic labeling
harmonious labeling
super edge-antimagic labeling
Opis:
We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.
Źródło:
Discussiones Mathematicae Graph Theory; 2008, 28, 2; 249-265
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposition of complete graphs into small graphs
Autorzy:
Froncek, D.
Powiązania:
https://bibliotekanauki.pl/articles/255502.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
graph decomposition
graph labeling
Opis:
In 1967, A. Rosa proved that if a bipartite graph G with n edges has an α-labeling, then for any positive integer p the complete graph K(2np+1) can be cyclically decomposed into copies of G. This has become a part of graph theory folklore since then. In this note we prove a generalization of this result. We show that every bipartite graph H which decomposes K(k) and K(m) also decomposes K(km).
Źródło:
Opuscula Mathematica; 2010, 30, 3; 277-280
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decomposition of Certain Complete Bipartite Graphs into Prisms
Autorzy:
Froncek, Dalibor
Powiązania:
https://bibliotekanauki.pl/articles/31342183.pdf
Data publikacji:
2017-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph decomposition
bipartite labeling
Opis:
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [1] Cichacz and Froncek established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn,n into generalized prisms of order 2n. In [2] and [3] Cichacz, Froncek, and Kovar showed decompositions of K3n/2,3n/2 into generalized prisms of order 2n. In this paper we prove that K6n/5,6n/5 is decomposable into prisms of order 2n when n ≡ 0 (mod 50).
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 1; 55-62
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Antimagic Labeling of Some Biregular Bipartite Graphs
Autorzy:
Deng, Kecai
Li, Yunfei
Powiązania:
https://bibliotekanauki.pl/articles/32222542.pdf
Data publikacji:
2022-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
antimagic labeling
bipartite
biregular
Opis:
An antimagic labeling of a graph G = (V, E) is a one-to-one mapping from E to {1, 2, . . ., |E|} such that distinct vertices receive different label sums from the edges incident to them. G is called antimagic if it admits an antimagic labeling. It was conjectured that every connected graph other than K2 is antimagic. The conjecture remains open though it was verified for several classes of graphs such as regular graphs. A bipartite graph is called (k, k′)-biregular, if each vertex of one of its parts has the degree k, while each vertex of the other parts has the degree k′. This paper shows the following results. (1) Each connected (2, k)-biregular (k ≥ 3) bipartite graph is antimagic; (2) Each (k, pk)-biregular (k ≥ 3, p ≥ 2) bipartite graph is antimagic; (3) Each (k, k2 + y)-biregular (k ≥ 3, y ≥ 1) bipartite graph is antimagic.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 4; 1205-1218
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
α2-labeling of graphs
Autorzy:
Froncek, D.
Powiązania:
https://bibliotekanauki.pl/articles/255852.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
graph decomposition
graph labeling
Opis:
We show that if a graph G on n edges allows certain special type of rosy labeling (a.k.a. rho;-labeling), called α2-labeling, then for any positive integer k the complete graph K2nk+1 can be decomposed into copies of G. This notion generalizes the α-labeling introduced in 1967 by A. Rosa.
Źródło:
Opuscula Mathematica; 2009, 29, 4; 393-397
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Product rosy labeling of graphs
Autorzy:
Fronček, Dalibor
Powiązania:
https://bibliotekanauki.pl/articles/743046.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph decomposition
graph labeling
Opis:
In this paper we describe a natural extension of the well-known ρ-labeling of graphs (also known as rosy labeling). The labeling, called product rosy labeling, labels vertices with elements of products of additive groups. We illustrate the usefulness of this labeling by presenting a recursive construction of infinite families of trees decomposing complete graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2008, 28, 3; 431-439
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pair L(2, 1)-Labelings of Infinite Graphs
Autorzy:
Yeh, Roger K.
Powiązania:
https://bibliotekanauki.pl/articles/31343562.pdf
Data publikacji:
2019-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
L(2
1)-labeling
Opis:
An L(2, 1)-labeling of a graph G = (V,E) is an assignment of nonnegative integers to V such that two adjacent vertices must receive numbers (labels) at least two apart and further, if two vertices are in distance 2 then they receive distinct labels. This article studies a generalization of the L(2, 1)-labeling. We assign sets with at least one element to vertices of G under some conditions.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 1; 257-269
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Distance Magic Index of a Graph
Autorzy:
Godinho, Aloysius
Singh, Tarkeshwar
Arumugam, S.
Powiązania:
https://bibliotekanauki.pl/articles/31342438.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
distance magic labeling
distance magic index
S -magic graph
S -magic labeling
Opis:
Let $G$ be a graph of order $n$ and let $S$ be a set of positive integers with $ |S| = n $. Then $G$ is said to be $S$-magic if there exists a bijection $ \phi : V (G) \rightarrow S $ satisfying $ \Sigma_{ x \in N } (u) \ \phi (x) = k $ (a constant) for every $ u \in V (G) $. Let $ \alpha (S) = \text{max} \{ s : s \in S \} $. Let $ i(G) = \text{min} \ \alpha (S) $, where the minimum is taken over all sets $S$ for which the graph $G$ admits an $S$-magic labeling. Then $ i(G) − n $ is called the distance magic index of the graph $G$. In this paper we determine the distance magic index of trees and complete bipartite graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 135-142
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Union of Distance Magic Graphs
Autorzy:
Cichacz, Sylwia
Nikodem, Mateusz
Powiązania:
https://bibliotekanauki.pl/articles/31342130.pdf
Data publikacji:
2017-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
distance magic labeling
magic constant
sigma labeling
graph labeling
union of graphs
lexicographic product
direct product
Kronecker product
Kotzig array
Opis:
A distance magic labeling of a graph $G = (V,E)$ with $|V | = n$ is a bijection $ \mathcal{l} $ from $V$ to the set ${1, . . ., n}$ such that the weight $ w(x) = \Sigma_{ y \in N_G } (x) \mathcal{l}(y) $ of every vertex $ x \in V $ is equal to the same element $ \mu $, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 1; 239-249
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extra Skolem Difference Mean Labeling of Some Graphs
Autorzy:
Sundari, G. Muppidathi
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1030829.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
F-tree
Skolem difference mean labeling
Y-tree
extra skolem difference mean labeling
Opis:
A graph G =(V,E) with p vertices and q edges is said to have skolem difference mean labeling if it is possible to label the vertices x ϵ V with distinct elements f (x) from the set {1,2…p+q} in such a way that the edge e =uv is labeled with |f(u)-f(v)|/2 if |f(u)-f(v)| is even and (|f(u)-f(v)|+1)/2 if |f(u)-f(v)| is odd and the resulting labels of the edges are distinct and are from {1,2…q}. A graph that admits skolem difference mean labeling is called a skolem difference mean graph. If one of the skolem difference mean labeling of G satisfies the condition that all the labels of the vertices are odd, then we call this skolem difference mean labeling an extra skolem difference mean labeling and call the graph G an extra skolem difference mean graph. In this paper, extra skolem difference mean labeling of some graphs are studied.
Źródło:
World Scientific News; 2020, 145; 210-221
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distance irregularity strength of graphs with pendant vertices
Autorzy:
Susanto, Faisal
Wijaya, Kristiana
Slamin
Semaničová-Feňovčíková, Andrea
Powiązania:
https://bibliotekanauki.pl/articles/2216177.pdf
Data publikacji:
2022
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
vertex k-labeling
distance irregular vertex k-labeling
distance irregularity strength
pendant vertices
Opis:
A vertex k-labeling ϕ : V (G) → {1, 2, . . . , k} on a simple graph G is said to be a distance irregular vertex k-labeling of G if the weights of all vertices of G are pairwise distinct, where the weight of a vertex is the sum of labels of all vertices adjacent to that vertex in G. The least integer k for which G has a distance irregular vertex k-labeling is called the distance irregularity strength of G and denoted by dis(G). In this paper, we introduce a new lower bound of distance irregularity strength of graphs and provide its sharpness for some graphs with pendant vertices. Moreover, some properties on distance irregularity strength for trees are also discussed in this paper.
Źródło:
Opuscula Mathematica; 2022, 42, 3; 439-458
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Edge product cordial labeling of some graphs
Autorzy:
Prajapati, U.M.
Patel, N.B.
Powiązania:
https://bibliotekanauki.pl/articles/122496.pdf
Data publikacji:
2019
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
graph labeling
edge product cordial labeling
teoria grafów
etykietowanie wykresów
kordialne oznaczenie produktu
Opis:
For a graph G = (V(G),E(G)) having no isolated vertex, a function ƒ : E(G)→{0;1} is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex be such that the number of edges with label 0 and the number of edges with label 1 differ by at the most 1 and the number of vertices with label 0 and the number of vertices with label 1 also differ by at the most 1. In this paper we discuss the edge product cordial labeling of the graphs Wn(t), PSn and DPSn.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2019, 18, 1; 69-76
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On super (a,d)-edge antimagic total labeling of certain families of graphs
Autorzy:
Roushini Leely Pushpam, P.
Saibulla, A.
Powiązania:
https://bibliotekanauki.pl/articles/743252.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
edge weight
magic labeling
antimagic labeling
ladder
fan graph
prism and web graph
Opis:
A (p, q)-graph G is (a,d)-edge antimagic total if there exists a bijection f: V(G) ∪ E(G) → {1, 2,...,p + q} such that the edge weights Λ(uv) = f(u) + f(uv) + f(v), uv ∈ E(G) form an arithmetic progression with first term a and common difference d. It is said to be a super (a, d)-edge antimagic total if the vertex labels are {1, 2,..., p} and the edge labels are {p + 1, p + 2,...,p + q}. In this paper, we study the super (a,d)-edge antimagic total labeling of special classes of graphs derived from copies of generalized ladder, fan, generalized prism and web graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 3; 535-543
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on strongly multiplicative graphs
Autorzy:
Adiga, Chandrashekar
Ramaswamy, H.
Somashekara, D.
Powiązania:
https://bibliotekanauki.pl/articles/744419.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
strongly multiplicative graphs
Opis:
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].
Źródło:
Discussiones Mathematicae Graph Theory; 2004, 24, 1; 81-83
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distance Magic Cartesian Products of Graphs
Autorzy:
Cichacz, Sylwia
Froncek, Dalibor
Krop, Elliot
Raridan, Christopher
Powiązania:
https://bibliotekanauki.pl/articles/31340995.pdf
Data publikacji:
2016-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
distance magic labeling
magic constant
sigma labeling
Cartesian product
hypercube
complete multipartite graph
cycle
Opis:
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ : V → {1, . . ., n} such that the weight of every vertex v, computed as the sum of the labels on the vertices in the open neighborhood of v, is a constant. In this paper, we show that hypercubes with dimension divisible by four are not distance magic. We also provide some positive results by proving necessary and sufficient conditions for the Cartesian product of certain complete multipartite graphs and the cycle on four vertices to be distance magic.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 2; 299-308
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Labeling in the education of gifted pupils
Autorzy:
Machů, Eva
Kočvarová, Ilona
Císlerová, Tereza
Powiązania:
https://bibliotekanauki.pl/articles/2011761.pdf
Data publikacji:
2015-09-30
Wydawca:
Wydawnictwo Adam Marszałek
Tematy:
giftedness
gifted pupil
labeling
enrichment curicullum
Opis:
The study presents an analysis of teachers’ tendency to label gifted pupils. A questionnaire was used at the level of lower secondary education. It was aimed at teachers’ educational strategies in the area of enriching the curriculum for gifted pupils, and teachers’ tendency to label gifted pupils. In conclusion, labeling does not belong to educational strategies of most teachers. Gender, pedagogical qualifications and the length of teaching experience do not influence teachers’ tendency to label gifted pupils. Teachers from specialized schools for gifted pupils have a stronger tendency to label them. This tendency is weaker in the case of teachers from small schools.
Źródło:
The New Educational Review; 2015, 41; 218-228
1732-6729
Pojawia się w:
The New Educational Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Radio numbers for generalized prism graphs
Autorzy:
Martinez, Paul
Ortiz, Juan
Tomova, Maggy
Wyels, Cindy
Powiązania:
https://bibliotekanauki.pl/articles/744118.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
radio number
radio labeling
prism graphs
Opis:
A radio labeling is an assignment c:V(G) → N such that every distinct pair of vertices u,v satisfies the inequality d(u,v) + |c(u)-c(v)| ≥ diam(G) + 1. The span of a radio labeling is the maximum value. The radio number of G, rn(G), is the minimum span over all radio labelings of G. Generalized prism graphs, denoted $Z_{n,s}$, s ≥ 1, n ≥ s, have vertex set {(i,j) | i = 1,2 and j = 1,...,n} and edge set {((i,j),(i,j ±1))} ∪ {((1,i),(2,i+σ)) | σ = -⌊(s-1)/2⌋...,0,...,⌊s/2⌋}. In this paper we determine the radio number of $Z_{n,s}$ for s = 1,2 and 3. In the process we develop techniques that are likely to be of use in determining radio numbers of other families of graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 1; 45-62
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Smallest Non-Autograph
Autorzy:
Baumer, Benjamin S.
Wei, Yijin
Bloom, Gary S.
Powiązania:
https://bibliotekanauki.pl/articles/31340873.pdf
Data publikacji:
2016-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
difference graphs
autographs
monographs
Opis:
Suppose that G is a simple, vertex-labeled graph and that S is a multiset. Then if there exists a one-to-one mapping between the elements of S and the vertices of G, such that edges in G exist if and only if the absolute difference of the corresponding vertex labels exist in S, then G is an autograph, and S is a signature for G. While it is known that many common families of graphs are autographs, and that infinitely many graphs are not autographs, a non-autograph has never been exhibited. In this paper, we identify the smallest non-autograph: a graph with 6 vertices and 11 edges. Furthermore, we demonstrate that the infinite family of graphs on n vertices consisting of the complement of two non-intersecting cycles contains only non-autographs for n ≥ 8.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 3; 577-602
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Oblong sum labeling of some special graphs
Autorzy:
Prema, M.
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1177840.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Star
oblong numbers
oblong sum labeling
Opis:
Numbers of the form n(n+1) are called oblong numbers. Let O_n be the n^th oblong number. An oblong sum labeling of a graph G =(V,E) with p vertices and q edges is a one to one function f : V(G)→{0,2,4,6,8,…} that induces a bijection f^*: E(G)→{O_1,O_2,O_3,…,O_q } of the edges of G defined by f^* (uv)=f(u)+f(v) for all e = uv ∈ E(G). The graph that admits oblong sum labeling is called oblong sum graph. In this paper, oblong sum labeling of some special graphs is studied.
Źródło:
World Scientific News; 2018, 98; 12-22
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Radio Number of Cycles and their Total Graphs
Autorzy:
Merlin, E. T.
Mangam, Tabitha Agnes
Powiązania:
https://bibliotekanauki.pl/articles/1177700.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Radio labeling
Radio number
Total graph
Opis:
A radio labeling f of G is an assignment of positive integers to the vertices of G satisfying, │f (u) – f (v)│≥ diam(G) + 1 - d (u ,v) ∀ u, v ∈ V (G) where d (u ,v) is the distance between any two vertices in the graph. The radio number denoted by rn (G) is the minimum span of a radio labeling for G. In this paper, an alternate proof for radio number of cycles and exact radio number for their total graphs has been discussed.
Źródło:
World Scientific News; 2018, 101; 55-64
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Consumer Perceptions of the Nutrition Labeling of Food Products
Autorzy:
Mieczkowska, M.
Panfil-Kuncewicz, H.
Powiązania:
https://bibliotekanauki.pl/articles/115871.pdf
Data publikacji:
2011
Wydawca:
Fundacja na Rzecz Młodych Naukowców
Tematy:
nutritional value
labeling
packaging
consumer researches
Opis:
The objective of this study was to evaluate consumer perceptions and preferences regarding food labeling and the information displayed on the packaging of food products, with particular emphasis on nutrition facts. The survey covered 283 respondents who were asked to fill out a questionnaire.
Źródło:
Challenges of Modern Technology; 2011, 2, 2; 53-55
2082-2863
2353-4419
Pojawia się w:
Challenges of Modern Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On 1-rotational decompositions of complete graphs into tripartite graphs
Autorzy:
Bunge, Ryan C.
Powiązania:
https://bibliotekanauki.pl/articles/255319.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
graph decomposition
1-rotational
vertex labeling
Opis:
Consider a tripartite graph to be any simple graph that admits a proper vertex coloring in at most 3 colors. Let G be a tripartite graph with n edges, one of which is a pendent edge. This paper introduces a labeling on such a graph G used to achieve 1-rotational G-decompositions of K2nt for any positive integer t. It is also shown that if G with a pendent edge is the result of adding an edge to a path on n vertices, then G admits such a labeling.
Źródło:
Opuscula Mathematica; 2019, 39, 5; 623-643
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Preparation of [61Cu]DTPA complex as a possible PET tracer
Autorzy:
Jalilian, A.
Rowshanfarzad, P.
Sabet, M.
Kamalidehghan, M.
Powiązania:
https://bibliotekanauki.pl/articles/147476.pdf
Data publikacji:
2006
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
copper-61
DTPA
labeling
PET
radiopharmaceuticals
Opis:
Copper-61 (T1/2 = 3.33 h) produced via the 64Zn(p,alfa)61Cu nuclear reaction, using a natural zinc target, was separated from the irradiated target material by two ion exchange chromatography steps and was used for the preparation of [61Cu]-diethylenetriaminepentacetate ([61Cu]DTPA) using freshly-prepared DTPA cyclic dianhydride. An electroplated natural zinc layer on a gold-coated copper backing was irradiated with 22 MeV protons (22 12 MeV on the target, 180 miA irradiation, 3.2 h, final activity 220 GBq of 61Cu2+, RCY > 95%, radionuclidic purity > 99%, 60Cu as the only radionuclidic impurity; T1/2 = 23.7 min). Colorimetric methods showed that traces of chemical impurities in the product were below the accepted limits. The solution of [61Cu]DTPA was prepared with a radiochemical yield of more than 80% starting with 61CuOAc ligand at room temperature after 30 min. RTLC showed the radiochemical purity of more than 99%. The specific activity obtained was about 9.1 TBq/mmol. The tracer was shown to be stable in the final product and in the presence of human serum at 37°C up to 3 h.
Źródło:
Nukleonika; 2006, 51, 2; 111-117
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On L(2, 1)-Labelings of Oriented Graphs
Autorzy:
Colucci, Lucas
Győri, Ervin
Powiązania:
https://bibliotekanauki.pl/articles/32361754.pdf
Data publikacji:
2022-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
L (2,1)-labeling
directed graphs
Opis:
We extend a result of Griggs and Yeh about the maximum possible value of the L(2, 1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the problem both in the usual definition of the oriented L(2, 1)-labeling number and in some variants we introduce.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 1; 39-46
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Number of α-Labeled Graphs
Autorzy:
Barrientos, Christian
Minion, Sarah
Powiązania:
https://bibliotekanauki.pl/articles/31342431.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
α -labeling
α -graph
graceful triangle
Opis:
When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of the graph, it becomes an α-labeling. This is the most restrictive type of difference-vertex labeling and it is located at the very core of this research area. Here we use an extension of the adjacency matrix to count and classify α-labeled graphs according to their size, order, and boundary value.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 177-188
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Preparation and biodistribution of [201Tl](III)vancomycin complex in normal rats
Autorzy:
Jalilian, A.
Hosseini, M.
Karimian, A.
Saddadi, F.
Sadeghi, M.
Powiązania:
https://bibliotekanauki.pl/articles/146167.pdf
Data publikacji:
2006
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
thallium-201
vancomycin
labeling
SPECT
radiopharmaceuticals
infection
Opis:
Thallium-201 (T1/2 = 3.04 days) in Tl+ form was converted to Tl3+ cation in presence of O3 in 6 M HCl controlled by RTLC/gel electrophoresis methods. The final evaporated activity was reacted with vancomycin (VAN) in water to yield [201Tl](III)VAN. The best results were obtained at room temperature in water after 30 min with a radiochemical yield > 99%, after mixing the reactants followed by SPE purification using Si Sep-Pak. The studies showed that thallic ion is mostly incorporated into vancomycin with a radiochemical purity of more than 98 š 1% by RTLC. A specific activity of about 4.14 x 1010 Bq/mmol was obtained. Radiochemical purity and stability of 201Tl-VAN in the preparation and in presence of human serum was determined up to 5.5 days. Biodistribution study of 201Tl(III)-vancomycin in normal rats was performed up to 52 h.
Źródło:
Nukleonika; 2006, 51, 4; 203-208
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Synthesis of ring labeled [1-14C]-L-tyrosine
Autorzy:
Kański, R.
Augustyniak, W.
Kańska, M.
Powiązania:
https://bibliotekanauki.pl/articles/148523.pdf
Data publikacji:
2006
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
carbon-14
labeling
tyrosine
enzyme
optical isotopomer
Opis:
The synthesis of specifically ring labeled isotopomer of L-tyrosine, (l-Tyr), using chemical and enzymatic methods is reported. The carbon-14 labeled [1’-14C]-L-Tyr has been synthesized by a 6-step conversion of [2-14C]-malonic acid into [4’-14C]-phenol and its subsequent condensation with S-methyl-L-cysteine using enzyme tyrosine phenol lyase from Citrobacter freundii.
Źródło:
Nukleonika; 2006, 51,suppl.2; 13-16
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
L(2, 1)-Labeling of Circulant Graphs
Autorzy:
Mitra, Sarbari
Bhoumik, Soumya
Powiązania:
https://bibliotekanauki.pl/articles/31343649.pdf
Data publikacji:
2019-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph coloring
L(2
1)-labeling
circulants
Opis:
An $L(2, 1)$-labeling of a graph $ \Gamma $ is an assignment of non-negative integers to the vertices such that adjacent vertices receive labels that differ by at least 2, and those at a distance of two receive labels that differ by at least one. Let $ \lambda_2^1 (\Gamma) $ denote the least $ \lambda $ such that $ \Gamma $ admits an $ L(2, 1) $-labeling using labels from $ \{ 0, 1, . . ., \lambda \} $. A Cayley graph of group $G$ is called a circulant graph of order $n$, if $ G = \mathbb{Z}_n$. In this paper initially we investigate the upper bound for the span of the $L(2, 1)$-labeling for Cayley graphs on cyclic groups with “large” connection sets. Then we extend our observation and find the span of $L(2, 1)$-labeling for any circulants of order $n$.
Źródło:
Discussiones Mathematicae Graph Theory; 2019, 39, 1; 143-155
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
α-Labelings of a Class of Generalized Petersen Graphs
Autorzy:
Benini, Anna
Pasotti, Anita
Powiązania:
https://bibliotekanauki.pl/articles/31339104.pdf
Data publikacji:
2015-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
generalized Petersen graph
α-labeling
graph decomposition
Opis:
An α-labeling of a bipartite graph $Γ$ of size $e$ is an injective function $f : V (Γ) → {0, 1, 2, . . ., e}$ such that ${|ƒ(x) − ƒ(y)| : [x, y] ∈ E(Γ)} = {1, 2, . . ., e}$ and with the property that its maximum value on one of the two bipartite sets does not reach its minimum on the other one. We prove that the generalized Petersen graph $P_{Sn,3}$ admits an α-labeling for any integer $n ≥ 1$ confirming that the conjecture posed by Vietri in [10] is true. In such a way we obtain an infinite class of decompositions of complete graphs into copies of $P_{Sn,3}$.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 1; 43-53
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized graph cordiality
Autorzy:
Pechenik, Oliver
Wise, Jennifer
Powiązania:
https://bibliotekanauki.pl/articles/743254.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph labeling
cordial graph
A-cordial
quasigroup
Opis:
Hovey introduced A-cordial labelings in [4] as a simultaneous generalization of cordial and harmonious labelings. If A is an abelian group, then a labeling f: V(G) → A of the vertices of some graph G induces an edge-labeling on G; the edge uv receives the label f(u) + f(v). A graph G is A-cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one and (2) the induced edge label classes differ in size by at most one.
Research on A-cordiality has focused on the case where A is cyclic. In this paper, we investigate V₄-cordiality of many families of graphs, namely complete bipartite graphs, paths, cycles, ladders, prisms, and hypercubes. We find that all complete bipartite graphs are V₄-cordial except K_{m,n} where m,n ≡ 2(mod 4). All paths are V₄-cordial except P₄ and P₅. All cycles are V₄-cordial except C₄, C₅, and Cₖ, where k ≡ 2(mod 4). All ladders P₂ ☐ Pₖ are V₄-cordial except C₄. All prisms are V₄-cordial except P₂ ☐ Cₖ, where k ≡ 2(mod 4). All hypercubes are V₄-cordial, except C₄.
Finally, we introduce a generalization of A-cordiality involving digraphs and quasigroups, and we show that there are infinitely many Q-cordial digraphs for every quasigroup Q.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 3; 557-567
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Radio number for some thorn graphs
Autorzy:
Marinescu-Ghemeci, Ruxandra
Powiązania:
https://bibliotekanauki.pl/articles/744574.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
multilevel distance labeling
radio number
caterpillar
diameter
Opis:
For a graph G and any two vertices u and v in G, let d(u,v) denote the distance between u and v and let diam(G) be the diameter of G. A multilevel distance labeling (or radio labeling) for G is a function f that assigns to each vertex of G a positive integer such that for any two distinct vertices u and v, d(u,v) + |f(u) - f(v)| ≥ diam(G) + 1. The largest integer in the range of f is called the span of f and is denoted span(f). The radio number of G, denoted rn(G), is the minimum span of any radio labeling for G. A thorn graph is a graph obtained from a given graph by attaching new terminal vertices to the vertices of the initial graph. In this paper the radio numbers for two classes of thorn graphs are determined: the caterpillar obtained from the path Pₙ by attaching a new terminal vertex to each non-terminal vertex and the thorn star $S_{n,k}$ obtained from the star Sₙ by attaching k new terminal vertices to each terminal vertex of the star.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 2; 201-222
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Radio Graceful Hamming Graphs
Autorzy:
Niedzialomski, Amanda
Powiązania:
https://bibliotekanauki.pl/articles/31340550.pdf
Data publikacji:
2016-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
radio labeling
radio graceful graph
Hamming graph
Opis:
For $ k \in \mathbb{Z}_+ $ and $G$ a simple, connected graph, a $k$-radio labeling $ f : V (G) \rightarrow \mathbb{Z}_+ $ of $G$ requires all pairs of distinct vertices $u$ and $v$ to satisfy $ |f(u) − f(v)| \ge k + 1 − d(u, v) $. We consider $k$-radio labelings of $G$ when $ k = \text{diam} (G)$. In this setting, $f$ is injective; if $f$ is also surjective onto $ {1, 2, . . ., |V (G)|} $, then $f$ is a consecutive radio labeling. Graphs that can be labeled with such a labeling are called radio graceful. In this paper, we give two results on the existence of radio graceful Hamming graphs. The main result shows that the Cartesian product of $t$ copies of a complete graph is radio graceful for certain $t$. Graphs of this form provide infinitely many examples of radio graceful graphs of arbitrary diameter. We also show that these graphs are not radio graceful for large $t$.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 4; 1007-1020
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Characterization Results for the L(2, 1, 1)-Labeling Problem on Trees
Autorzy:
Zhang, Xiaoling
Deng, Kecai
Powiązania:
https://bibliotekanauki.pl/articles/32031843.pdf
Data publikacji:
2017-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
tree
diameter
L(2, 1, 1)-labeling
Opis:
An L(2, 1, 1)-labeling of a graph G is an assignment of non-negative integers (labels) to the vertices of G such that adjacent vertices receive labels with difference at least 2, and vertices at distance 2 or 3 receive distinct labels. The span of such a labelling is the difference between the maximum and minimum labels used, and the minimum span over all L(2, 1, 1)-labelings of G is called the L(2, 1, 1)-labeling number of G, denoted by λ2,1,1(G). It was shown by King, Ras and Zhou in [The L(h, 1, 1)-labelling problem for trees, European J. Combin. 31 (2010) 1295–1306] that every tree T has Δ2(T) − 1 ≤ λ2,1,1(T) ≤ Δ2(T), where Δ2(T) = maxuv∈E(T)(d(u) + d(v)). And they conjectured that almost all trees have the L(2, 1, 1)-labeling number attain the lower bound. This paper provides some sufficient conditions for λ2,1,1(T) = Δ2(T). Furthermore, we show that the sufficient conditions we provide are also necessary for trees with diameter at most 6.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 611-622
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Can macular xanthophylls replace cholesterol in formation of the liquid-ordered phase in lipid-bilayer membranes?
Autorzy:
Subczynski, Witold
Wisniewska-Becker, Anna
Widomska, Justyna
Powiązania:
https://bibliotekanauki.pl/articles/1039790.pdf
Data publikacji:
2012
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
lutein
spin-labeling
zeaxanthin
liquid-ordered phase
EPR
Opis:
Lateral organization of membranes made from binary mixtures of dimyristoylphosphatidylcholine (DMPC) or dipalmitoylphosphatidylcholine (DPPC) and macular xanthophylls (lutein or zeaxanthin) was investigated using the saturation-recovery (SR) EPR spin-labeling discrimination by oxygen transport (DOT) method in which the bimolecular collision rate of molecular oxygen with the nitroxide spin label is measured. This work was undertaken to examine whether or not lutein and zeaxanthin, macular xanthophylls that parallel cholesterol in its function as a regulator of both membrane fluidity and hydrophobicity, can parallel other structural functions of cholesterol, including formation of the liquid-ordered phase in membranes. The DOT method permits discrimination of different membrane phases when the collision rates (oxygen transport parameter) differ in these phases. Additionally, membrane phases can be characterized by the oxygen transport parameter in situ without the need for separation, which provides information about the dynamics of each phase. In gel-phase membranes, two coexisting phases were discriminated in the presence of macular xanthophylls - namely, the liquid-ordered-like and solid-ordered-like phases. However, in fluid-phase membranes, xanthophylls only induce the solitary liquid-ordered-like phase, while at similar concentrations, cholesterol induces coexisting liquid-ordered and liquid-disordered phases. No significant differences between the effects of lutein and zeaxanthin were found.
Źródło:
Acta Biochimica Polonica; 2012, 59, 1; 109-114
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
'Pasjonaci: dewianci, dziwacy, 'normalsi', czyli o roszczeniu uznania normalnosci
HOBBYISTS-MADCAPS: DEVIANTS, FREAKS, NORMALS - ABOUT A CLAIM FOR THE NORMALITY ACKNOWLEDGEMENT
Autorzy:
Dymarczyk, Waldemar
Powiązania:
https://bibliotekanauki.pl/articles/623011.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
LABELING
MADCAP (HOBBYIST)
NORM
PASSION
SOCIAL DISTINCTNESS
STIGMATIZATION
Opis:
The article presents the author's attempt to define a particular kind of people who realize various types of interests with a strong commitment - the 'hobbyists'. Primarily open to scrutiny, is how the typical patterns of their careers are being constructed. Moreover, both the significant others' negative reactions to hobbyists' activity, and the reasons of why they act in a certain way are elucidated. Hobbyists' strategies and actions undertaken in order to defend against 'deviants' stigmatization', and their struggle for a status of being 'normal' are presented in (ewentualnie the further parts of) this article. The 'revealed' (lub reconstructed) strategies are: Professionalization of hobbyist's passion; 'Factual' denial of stereotypical view; Dividing 'normal' hobbyists from 'deviant' ones, Underlining one's exceptionality (dramatization) in order to gain the acceptance; Using humor and sarcasm; Distancing from the one's social world.
Źródło:
Przegląd Socjologii Jakościowej; 2011, 7, 1; 57-72
1733-8069
Pojawia się w:
Przegląd Socjologii Jakościowej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On super edge-antimagic total labeling of subdivided stars
Autorzy:
Javaid, Muhammad
Powiązania:
https://bibliotekanauki.pl/articles/30148713.pdf
Data publikacji:
2014-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
subdivision of star
super ($a, d$)-EAT labeling
Opis:
In 1980, Enomoto et al. proposed the conjecture that every tree is a super ($a, 0$)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super ($a, d$)-edge-antimagic total labelings on a subclass of subdivided stars denoted by $T(n, n + 1, 2n + 1, 4n + 2, n_5, n_6, . . ., n_r)$ for different values of the edge-antimagic labeling parameter $d$, where $n ≥ 3$ is odd, $n_m = 2^{m−4}(4n+1)+1, r ≥ 5$ and $5 ≤ m ≤ r$.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 4; 691-706
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Super $(a, d)$-$H$-Antimagic Total Covering of Star Related Graphs
Autorzy:
Kathiresan, K.M.
Laurence, S. David
Powiązania:
https://bibliotekanauki.pl/articles/31234087.pdf
Data publikacji:
2015-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
super (a
d)-H-antimagic total labeling
star
Opis:
Let $G = (V (G), E (G))$ be a simple graph and $H$ be a subgraph of $G$. $G$ admits an $H$-covering, if every edge in $E(G)$ belongs to at least one subgraph of $G$ that is isomorphic to $H$. An $(a, d)$-$H$-antimagic total labeling of $G$ is a bijection $ \lambda : V (G) \cup E(G) \rightarrow {1, 2, 3, . . ., |V (G)| + |E(G)|}$ such that for all subgraphs $ H^' $ isomorphic to $H$, the $H^′$ weights $ wt(H^') = \sum_{v \in V (H^') } \lambda (v) + \sum_{e \in E(H^')} \lambda (e) $ constitute an arithmetic progression $a$, $a+d$, $a+2d$, . . ., $a+(n−1)d$ where $a$ and $d$ are positive integers and $n$ is the number of subgraphs of $G$ isomorphic to $H$. Additionally, the labeling $ \lambda $ is called a super $(a, d)$-$H$-antimagic total labeling if $ \lambda (V (G)) = {1, 2, 3, . . ., |V (G)|} $. In this paper we study super $(a, d)-H$-antimagic total labelings of star related graphs $ G_u[S_n]$ and caterpillars.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 4; 755-764
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Supermagic Graphs Having a Saturated Vertex
Autorzy:
Ivančo, Jaroslav
Polláková, Tatiana
Powiązania:
https://bibliotekanauki.pl/articles/30147220.pdf
Data publikacji:
2014-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
supermagic graph
saturated vertex
vertex-magic total labeling
Opis:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 1; 75-84
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Occupational risk resulting from exposure to mineral wool when installing insulation in buildings
Autorzy:
Kupczewska-Dobecka, Małgorzata
Konieczko, Katarzyna
Czerczak, Sławomir
Powiązania:
https://bibliotekanauki.pl/articles/2116490.pdf
Data publikacji:
2020-10-20
Wydawca:
Instytut Medycyny Pracy im. prof. dra Jerzego Nofera w Łodzi
Tematy:
mineral wool
insulation
fibers
health effects
toxicity
labeling
Opis:
Mineral wool is widely used for thermal and sound insulation. The subject of the study is to identify hazards for employees resulting from exposure to mineral wool, when it is used to insulate buildings, and to assess the risk arising from this exposure. When installing mineral wool insulation, respirable mineral fibers, dust, and volatile organic compounds may pose a hazard at workplaces. Based on the results of concentration measurements, it was assessed that the probability of adverse health effects related to the work of insulation installers, resulting from exposure to mineral wool fibers, is low, but for dust associated with exposure, an average health risk was estimated. An additional threat may be the sensitizing effect of substances used as binders and additives improving the utility properties of mineral wool, for example, phenol formaldehyde resins. The paper also contains some information on the labeling of mineral wool; this is very important because the label allows downstream users to recognize mineral wools, the composition and properties of which cause that they are not classified as carcinogens.
Źródło:
International Journal of Occupational Medicine and Environmental Health; 2020, 33, 6; 757-769
1232-1087
1896-494X
Pojawia się w:
International Journal of Occupational Medicine and Environmental Health
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On H-Irregularity Strength Of Graphs
Autorzy:
Ashraf, Faraha
Bača, Martin
Lascśaková, Marcela
Semaničová-Feňovčíková, Andrea
Powiązania:
https://bibliotekanauki.pl/articles/31341574.pdf
Data publikacji:
2017-11-27
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
H-covering
H-irregular labeling
H-irregularity strength
Opis:
New graph characteristic, the total H-irregularity strength of a graph, is introduced. Estimations on this parameter are obtained and for some families of graphs the precise values of this parameter are proved.
Źródło:
Discussiones Mathematicae Graph Theory; 2017, 37, 4; 1067-1078
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pentagonal Graceful Labeling of Some Graphs
Autorzy:
Mahendran, S.
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1193373.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Pentagonal graceful number
pentagonal graceful graphs
pentagonal graceful labeling
Opis:
Numbers of the form (n(3n-1))/2 for all n ≥ 1 are called pentagonal numbers. Let G be a graph with p vertices and q edges. Let f : V(G)→{0,1,2,…,P_q} where P_q is the q^th pentagonal number be an injective function. Define the function f *: E(G) → {1,5,…,P_q} such that f *(uv)=│f(u)-f(v)│for all edges uv∈E(G). If f *( E(G)) is a sequence of distinct consecutive pentagonal numbers {P_1,P_2,…,P_q}, then the function f is said to be pentagonal graceful labeling and the graph which admits such a labeling is called a pentagonal graceful graph. In this paper, pentagonal graceful labeling of some graphs is studied.
Źródło:
World Scientific News; 2021, 155; 98-112
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Results on Octagonal Graceful Graphs
Autorzy:
Kovusalya, K.
Namasivayam, P.
Powiązania:
https://bibliotekanauki.pl/articles/1193388.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Octagonal graceful number
octagonal graceful graphs
octagonal graceful labeling
Opis:
Numbers of the form On = n (3n-2) for all n≥1 are called octagonal numbers. Let G be a graph with p vertices and q edges. Let f: V (G) → {0, 1, 2… Om} where Om is the mth octagonal number be an injective function. Define the function f*:E(G) → {1,8,21,..,Om} such that f*(uv) = |f(u)-f(v)| for all edges uvϵE(G). If f*(E (G)) is a sequence of distinct consecutive octagonal numbers {O1, O2 , …, Oq }, then the function f is said to be octagonal graceful labeling and the graph which admits such a labeling is called a octagonal graceful graph. In this paper, octagonal graceful labeling of some graphs is studied.
Źródło:
World Scientific News; 2021, 156; 1-12
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Octagonal Graceful Labeling of Some Special Graphs
Autorzy:
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193401.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Octagonal graceful number
octagonal graceful graphs
octagonal graceful labeling
Opis:
Numbers of the form 3n2-2n for all n ≥ 1 are called octagonal numbers. Let G be a graph with p vertices and q edges. Let f :V(G)→{0,1,2,…,M_q} where M_q is the q^th octagonal number be an injective function. Define the function f *: E(G) → {1,8,…,M_q} such that f *(uv) = │f(u)-f(v)│for all edges uv ∈E(G). If f *(E(G)) is a sequence of distinct consecutive octagonal numbers {M_1,M_2,…,M_q}, then the function f is said to be octagonal graceful labeling and the graph which admits such a labeling is called a octagonal graceful graph. In this paper, octagonal graceful labeling of some graphs is studied.
Źródło:
World Scientific News; 2021, 156; 87-101
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
L(2, 1)-Labelings of Some Families of Oriented Planar Graphs
Autorzy:
Sen, Sagnik
Powiązania:
https://bibliotekanauki.pl/articles/30147217.pdf
Data publikacji:
2014-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
homomorphism
planar graph
girth
partial k-tree
outerplanar graph
cactus
2-dipath L(2, 1)-labeling
oriented L(2, 1)-labeling
Opis:
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Źródło:
Discussiones Mathematicae Graph Theory; 2014, 34, 1; 31-48
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A totally magic cordial labeling of one-point union of n copies of a graph
Autorzy:
Jeyanthi, P.
Angel-Benseera, N.
Powiązania:
https://bibliotekanauki.pl/articles/255325.pdf
Data publikacji:
2014
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
totally magic cordial labeling
one-point union of graphs
Opis:
A graph G is said to have a totally magic cordial (TMC) labeling with constant C if there exists a mapping ƒ : V (G) ∪ E(G) → {0, 1} such that ƒ(a)+ ƒ (b)+ ƒ(ab) ≡ C(mod 2) for all ab ∈ E(G) and [formula], where nƒ(i) (i = 0, 1) is the sum of the number of vertices and edges with label i. In this paper, we establish the totally magic cordial labeling of one-point union of n-copies of cycles, complete graphs and wheels.
Źródło:
Opuscula Mathematica; 2014, 34, 1; 115-122
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Super Edge-Antimagicness of Subdivided Stars
Autorzy:
Raheem, A.
Javaid, M.
Baig, A.Q.
Powiązania:
https://bibliotekanauki.pl/articles/31339258.pdf
Data publikacji:
2015-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
super (a
d)-EAT labeling
stars
subdivision of stars
Opis:
Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In the support of this conjecture, the present paper deals with different results on super (a, d)-edge-antimagic total labeling of subdivided stars for d ∈ {0, 1, 2, 3}.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 4; 663-673
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Constant Sum Partition of Sets of Integers and Distance Magic Graphs
Autorzy:
Cichacz, Sylwia
Gőrlich, Agnieszka
Powiązania:
https://bibliotekanauki.pl/articles/31342439.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
constant sum partition
distance magic labeling
product of graphs
Opis:
Let $ A = {1, 2, . . ., tm+tn} $. We shall say that $A$ has the $(m, n, t)$-balanced constant-sum-partition property ($(m, n, t)$-BCSP-property) if there exists a partition of $A$ into $2t$ pairwise disjoint subsets $ A^1, A^2, ... , A^t, B^1, B^2, ... , B^t$ such that $ | A^i | = m $ and $ | B^i | = n $, and $ \Sigma_{ a \in A^i } \ a = \Sigma_ {b \in B^j} \ b $ for $ 1 \le i \le t $ and $ 1 \le j \le t $. In this paper we give sufficient and necessary conditions for a set $A$ to have the $(m, n, t)$-BCSP-property in the case when $m$ and $n$ are both even. We use this result to show some families of distance magic graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 97-106
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of [66Ga]oxine complex; a possible PET tracer
Autorzy:
Jalilian, A.
Rowshanfarzad, P.
Sabet, M.
Rahiminejad-Kisomi, A.
Rajamand, A.
Powiązania:
https://bibliotekanauki.pl/articles/146276.pdf
Data publikacji:
2006
Wydawca:
Instytut Chemii i Techniki Jądrowej
Tematy:
gallium-66
oxine
positron emission tomography
blood cell labeling
stability
Opis:
The aim of this work is development of a possible blood cell labeling agent for ultimate use in PET. Gallium-66 (T1/2 = 9.49 h) is an interesting radionuclide that has a potential for positron emission tomography (PET) imaging of biological processes with intermediate to slow target tissue uptake. Oxine has been labeled with this radionuclide in the form of [66Ga]gallium chloride for its possible diagnostic properties. In this study, 66Ga was produced at a 30 MeV cyclotron (IBA-Cyclone 30) via the 66Zn(p,n)66Ga reaction. The production yield was 445.5 MBq/mAh. The [66Ga]oxine complex was obtained at pH = 5 in phosphate buffer medium at 37°C in 10 min. Radio-TLC showed a radiochemical purity of more than 98 š 2%. The chemical stability of the complex was checked in vitro with a specific activity of 1113 GBq/mmol. The serum stability and log P of the complex were calculated. The produced [66Ga]oxine can be used for diagnostic studies, due to its desirable physico-chemical properties both in vitro and in vivo according to internationally accepted limits.
Źródło:
Nukleonika; 2006, 51, 3; 155-159
0029-5922
1508-5791
Pojawia się w:
Nukleonika
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cloning of two genes encoding Rab7 in Paramecium
Autorzy:
Surmacz, Liliana
Wiejak, Jolanta
Wyroba, Elzbieta
Powiązania:
https://bibliotekanauki.pl/articles/1041281.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
Rab7
hybridization
Paramecium
digoxygenin labeling
cloning
PCR/RT-PCR
Opis:
Rab7 is a small GTPase that plays a crucial role in the regulation of transport from early to late endosomes and lysosomes, phagosome maturation and in lysosomal biogenesis in mammalian cells. It contains conserved and unique sequence elements that mediate its function. Two Rab7 genes, Rab7a (703 bp) and Rab7b (707 bp) were identified in the unicellular eukaryote Paramecium by PCR amplification. They contain three short introns of different lengths (28-32 bp) and sequence located at identical positions in both genes. The presence of two Rab7 genes in the Paramecium genome was confirmed by Southern hybridization analysis performed with six different restriction enzymes. Expression of both genes was assessed by Northern blot and RT-PCR. Two transcripts of 1.8 and 2.2 kb were identified by hybridization analysis. The cloned complementary DNAs, both of 618 nucleotides in length, encode polypeptides of 206 amino acids that are 97.6% identical and differ in their C-termini. The predicted protein sequences of Rab7a and Rab7b contain all characteristic domains essential for Rab function: the effector domain (YRATVGADF) and four GTP-binding consensus sequences (GDSGVGKT, WDTAGQ, NKLD, SAK) as well as the prenylation motif (-CC) at the C-terminus indispensable for Rab binding to the membrane. Similarity searches revealed 81.6-82.1% homology of Paramecium Rab7 isoforms to human Rab7 and a lack of an insert typical for the Kinetoplastida - the species that appeared earlier in evolution. Paramecium is the first free-living lower eukaryote in which homologues of Rab7 have been identified that exhibit features similar to those of mammalian Rab7.
Źródło:
Acta Biochimica Polonica; 2006, 53, 1; 149-156
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Additive List Coloring of Planar Graphs with Given Girth
Autorzy:
Brandt, Axel
Jahanbekam, Sogol
White, Jennifer
Powiązania:
https://bibliotekanauki.pl/articles/31525335.pdf
Data publikacji:
2020-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
lucky labeling
additive coloring
reducible configuration
discharging method
Combinatorial Nullstellensatz
Opis:
An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . ., k} such that two adjacent vertices have distinct sums of labels on their neighbors. The least integer k for which a graph G has an additive coloring is called the additive coloring number of G, denoted χΣ (G). Additive coloring is also studied under the names lucky labeling and open distinguishing. In this paper, we improve the current bounds on the additive coloring number for particular classes of graphs by proving results for a list version of additive coloring. We apply the discharging method and the Combinatorial Nullstellensatz to show that every planar graph G with girth at least 5 has χΣ (G) ≤ 19, and for girth at least 6, 7, and 26, χΣ (G) is at most 9, 8, and 3, respectively. In 2009, Czerwiński, Grytczuk, and Żelazny conjectured that χΣ (G) ≤ χ(G), where χ(G) is the chromatic number of G. Our result for the class of non-bipartite planar graphs of girth at least 26 is best possible and affirms the conjecture for this class of graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 855-873
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Local Antimagic Chromatic Number of Cycle-Related Join Graphs
Autorzy:
Lau, Gee-Choon
Shiu, Wai-Chee
Ng, Ho-Kuen
Powiązania:
https://bibliotekanauki.pl/articles/32083818.pdf
Data publikacji:
2021-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
local antimagic labeling
local antimagic chromatic number
cycle
join graphs
Opis:
An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, . . ., |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = Σf(e), with e ranging over all the edges incident to x. The local antimagic chromatic number of G, denoted by χla(G), is the minimum number of distinct induced vertex labels over all local antimagic labelings of G. In this paper, several sufficient conditions for χla(H) ≤ χla(G) are obtained, where H is obtained from G with a certain edge deleted or added. We then determined the exact value of the local antimagic chromatic number of many cycle-related join graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 1; 133-152
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Two Modulo Three Sum Graphs
Autorzy:
Esakki, M. Vanu
Nisaya, M. P. Syed Ali
Powiązania:
https://bibliotekanauki.pl/articles/1030957.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Two modulo three sum graph
Two modulo three sum labeling
Opis:
Let G = (V, E) be a graph with p vertices and q edges is said to be a two modulo three sum graph if there is an injective function f from V(G) to { a∶0≤a≤3q-1 and either a≡0(mod 3) or a≡2(mod 3)} where q is the number of edges of G and such that finduces a bijectionf^* from E(G) to {a∶2≤a≤3q-1 and a≡2(mod 3)} given byf^* (uv)=f(u)+f(v)and the function f is called two modulo three sum labeling of G. In this paper, we introduce an analog of sum labeling known as two modulo three sum labeling and we define two modulo three sum labeling of some tree related graphs. Also we prove that split star, mirror path graph, complete bipartite graph and C_4 ʘ〖nK〗_1 are two modulo three sum graphs.
Źródło:
World Scientific News; 2020, 145; 274-285
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Znakowanie żywności wolnej od GMO w polskim systemie prawa żywnościowego
Labeling non-GMO foods in the Polish food law scheme
Autorzy:
Kowalska, Aleksandra
Kowalski, Jarosław
Powiązania:
https://bibliotekanauki.pl/articles/1037643.pdf
Data publikacji:
2020-06-30
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
GMO
food law
labeling of food
prawo żywnościowe
znakowanie żywności
Opis:
Przedmiotem badań było znakowanie żywności wolnej od GMO w celu określenia istoty znakowania żywności i pasz w odniesieniu do wykorzystania GMO podczas ich wytwarzania. W artykule dokonano analizy dogmatycznej przepisów ustawy z 13 czerwca 2019 r. o oznakowaniu produktów wytworzonych bez wykorzystania organizmów genetycznie zmodyfikowanych jako wolnych od tych organizmów na tle regulacji prawa UE. Zastosowano następujące metody badawcze: analizę aktów normatywnych, analizę źródeł literaturowych, analizę dokumentów wtórnych (sprawozdań, raportów). W opracowaniu omówiono problemy wynikające ze stosowania inżynierii genetycznej w uprawie roślin i hodowli zwierząt, dokonano przeglądu regulacji UE dotyczących GMO oraz szczegółowo przeanalizowano nowe przepisy dotyczące znakowania żywności wolnej od GMO w Polsce. Realizacja prawa do informacji poprzez znakowanie żywności tworzy podstawę dokonywania przez konsumentów świadomych wyborów i ma zasadnicze znaczenie dla zapewnienia im wysokiego poziomu ochrony życia, zdrowia i interesów ekonomiczno-społecznych. Ujednolicenie informacji o specyfice produktów wolnych od GMO w nowej ustawie sprawia, że przekaz jest jasny i przejrzysty, co może wpłynąć na budowanie zaufania między konsumentami i producentami żywności i pasz.
The research problem addressed in this work is the labeling of GMO-free food. The main aim of the paper is to determine the essence of food and feed labeling regarding the use of GMO. An analysis of the Polish Act of 13 June 2019 on the Labeling of Products Produced without the Use of Genetically Modified Organisms, and thus being free from such organisms, is performed in the context of the EU food law. The following research methods were applied in the course of the research: an analysis of national and EU legislation, an analysis of the subject literature, and an analysis of secondary documents (statements, reports). Food labeling provides a basis for consumers to make informed choices and is crucial for ensuring a high level of protection of human life, health, and socio-economic interests. The unification of information on the specificity of non-GMO products in the new law makes the message transparent and clear, which may have implications for stronger confidence among business and consumers.
Źródło:
Ruch Prawniczy, Ekonomiczny i Socjologiczny; 2020, 82, 2; 213-228
0035-9629
2543-9170
Pojawia się w:
Ruch Prawniczy, Ekonomiczny i Socjologiczny
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ℤ2 × ℤ2 -Cordial Cycle-Free Hypergraphs
Autorzy:
Cichacz, Sylwia
Görlich, Agnieszka
Tuza, Zsolt
Powiązania:
https://bibliotekanauki.pl/articles/32361757.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
V 4 -cordial graph
hypergraph
labeling of hypergraph
hyper-tree
Opis:
Hovey introduced A-cordial labelings as a generalization of cordial and harmonious labelings [7]. If A is an Abelian group, then a labeling f : V (G) → A of the vertices of some graph G induces an edge labeling on G; the edge uv receives the label f(u) + f(v). A graph G is A-cordial if there is a vertex-labeling such that (1) the vertex label classes differ in size by at most one and (2) the induced edge label classes differ in size by at most one. The problem of A-cordial labelings of graphs can be naturally extended for hypergraphs. It was shown that not every 2-uniform hypertree (i.e., tree) admits a ℤ2 × ℤ2-cordial labeling [8]. The situation changes if we consider p-uniform hypertrees for a bigger p. We prove that a p-uniform hypertree is ℤ2 × ℤ2-cordial for any p > 2, and so is every path hypergraph in which all edges have size at least 3. The property is not valid universally in the class of hypergraphs of maximum degree 1, for which we provide a necessary and sufficient condition.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 1021-1040
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some results on centered triangular graceful graphs
Autorzy:
Baskar, M.
Namasivayam, P.
Syed Ali Nisaya, M. P.
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193414.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Centered triangular numbers
centered triangular graceful graphs
centered triangular graceful labeling
Opis:
Let G be a graph with p vertices and q edges. The nth centered triangular number is denoted by C_n, where C_n = 1/2 (3n2 - 3n + 2). A centered triangular graceful labeling of a graph G is a one-to-one function f : V (G) → {0,1,…C_q} that induces a bijection f *: E(G) →{C_1 〖,C〗_2,…C_q} of the edges of G defined by f * (e) = │f(u) - f(v)│, for all e = uv ∊ E(G). The graph which admits such labeling is called a centered triangular graceful graph.
Źródło:
World Scientific News; 2021, 156; 176-191
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
NMR studies of human cystatin C - stable isotope labeling of human cystatin C
Autorzy:
Jurczak, P.
Maszota-Zieleniak, M.
Powiązania:
https://bibliotekanauki.pl/articles/1935821.pdf
Data publikacji:
2014
Wydawca:
Politechnika Gdańska
Tematy:
NMR
overproduction
stable isotopes
proteins
labeling
nadprodukcja
stabilne izotopy
białka
etykietowanie
Opis:
The objective of this study was to obtain a double and triple labeled human cystatin C (hCC). Another objective was to record sets of 2D and 3D NMR spectra of the hCC dimer (in a solution) using a 700MHz spectrometer. The data obtained during attempts to determine the NMR structure should provide useful information about chemical shifts of amino acid residues. They will certainly accelerate solving the human cystatin C NMR structure. In this paper the main focus is put on triple isotopic labeling, protein overproduction and NMR analysis of hCC. The first two processes lead to obtaining hCC labeled with stable isotopes of carbon ( 13 C), nitrogen ( 15 N) and hydrogen ( 2 H) (double labeled hCC was obtained with a similar method). The obtained protein was later used for the purpose of NMR spectra.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2014, 18, 4; 327--330
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Total vertex irregularity strength of disjoint union of Helm graphs
Autorzy:
Ahmad, Ali
Baskoro, E.
Imran, M.
Powiązania:
https://bibliotekanauki.pl/articles/743230.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
vertex irregular total k-labeling
Helm graphs
total vertex irregularity strength
Opis:
A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. We have determined an exact value of the total vertex irregularity strength of disjoint union of Helm graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 3; 427-434
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Oblong Sum Labeling of Union of Some Graphs
Autorzy:
Muthumanickavel, G.
Murugan, K.
Powiązania:
https://bibliotekanauki.pl/articles/1030786.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Oblong numbers
Oblong sum labeling
subdivision of graphs
union of graphs
Opis:
An oblong sum labeling of a graph G = (V,E) with p vertices and q edges is a one to one function f:V(G) → {0,2,4,6,...} that induces a bijection f* : E(G) → {O_1,O_2,O_3,..., O_q} of the edges of G defined by f*(uv) = f(u) + f(v) for all e = uv ∈ E(G). The graph that admits oblong sum labeling is called oblong sum graph. In this article, the oblong sum labeling of union of some graphs are studied.
Źródło:
World Scientific News; 2020, 145; 85-94
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Attaching a spin to a protein - site-directed spin labeling in structural biology
Autorzy:
Czogalla, Aleksander
Pieciul, Aldona
Jezierski, Adam
Sikorski, Aleksander
Powiązania:
https://bibliotekanauki.pl/articles/1041067.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
protein structure
site-directed spin labeling
electron paramagnetic resonance (EPR) spectroscopy
Opis:
Site-directed spin labeling and electron paramagnetic resonance spectroscopy have recently experienced an outburst of multiple applications in protein science. Numerous interesting strategies have been introduced for determining the structure of proteins and its conformational changes at the level of the backbone fold. Moreover, considerable technical development in the field makes the technique an attractive approach for the study of structure and dynamics of membrane proteins and large biological complexes at physiological conditions. This review focuses on a brief description of site-directed spin labeling-derived techniques in the context of their recent applications.
Źródło:
Acta Biochimica Polonica; 2007, 54, 2; 235-244
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some results on centered triangular sum graphs
Autorzy:
Baskar, M.
Namasivayam, P.
Syed Ali Nisaya, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/1193374.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Centered triangular numbers
centered triangular sum graphs
centered triangular sum labeling
Opis:
A centered triangular sum labeling of a graph G is a one-to-one function f : V (G) → N ∪{0} that induces a bijection f *: E(G) →{B_1 〖,B〗_2,…B_q} of the edges of G defined by f * (uv) = f(u) + f(v), for all e = uv ∊ E(G). The graph which admits such labeling is called a centered triangular sum graph.
Źródło:
World Scientific News; 2021, 155; 113-128
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Further results on centered triangular sum graphs
Autorzy:
Baskar, M.
Namasivayam, P.
Syed Ali Nisaya, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/1193390.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Centered triangular numbers
centered triangular sum graphs
centered triangular sum labeling
Opis:
Let G be a graph with p vertices and q edges. The nth centered triangular number is denoted by M_n, where M_n = 1/2 (3n2 - 3n + 2). A centered triangular sum labeling of a graph G is a one-to-one function : V (G) → N ∪{0} that induces a bijection f *: E(G) →{M_1 〖,M〗_2,…M_q} of the edges of G defined by f * (uv) = f(u) + f(v), for all e = uv ∊ E(G). The graph which admits such labeling is called a centered triangular sum graph. In this article, the centered triangular sum labeling of union of some graphs are studied.
Źródło:
World Scientific News; 2021, 156; 13-25
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Linear and cyclic radio k-labelings of trees
Autorzy:
Kchikech, Mustapha
Khennoufa, Riadh
Togni, Olivier
Powiązania:
https://bibliotekanauki.pl/articles/743693.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph theory
radio channel assignment
cyclic and linear radio k-labeling
Opis:
Motivated by problems in radio channel assignments, we consider radio k-labelings of graphs. For a connected graph G and an integer k ≥ 1, a linear radio k-labeling of G is an assignment f of nonnegative integers to the vertices of G such that
$|f(x)-f(y)| ≥ k+1-d_G(x,y)$,
for any two distinct vertices x and y, where $d_G(x,y)$ is the distance between x and y in G. A cyclic k-labeling of G is defined analogously by using the cyclic metric on the labels. In both cases, we are interested in minimizing the span of the labeling. The linear (cyclic, respectively) radio k-labeling number of G is the minimum span of a linear (cyclic, respectively) radio k-labeling of G. In this paper, linear and cyclic radio k-labeling numbers of paths, stars and trees are studied. For the path Pₙ of order n ≤ k+1, we completely determine the cyclic and linear radio k-labeling numbers. For 1 ≤ k ≤ n-2, a new improved lower bound for the linear radio k-labeling number is presented. Moreover, we give the exact value of the linear radio k-labeling number of stars and we present an upper bound for the linear radio k-labeling number of trees.
Źródło:
Discussiones Mathematicae Graph Theory; 2007, 27, 1; 105-123
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Special Results for Square Pyramidal Graceful Graphs
Autorzy:
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193411.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Square pyramidal graceful number
square pyramidal graceful graphs
square pyramidal graceful labeling
Opis:
Numbers of the form (n(n+1)(2n+1))/6 for all n≥1 are called square pyramidal numbers. Let G be a graph with p vertices and q edges. Let τ : V(G) →{0, 1, 2… M_k} where M_k is the k^th square pyramidal number be an injective function. Define the function τ*:E(G)→{1,5,14,.., M_k} such that τ *(uv) = |τ (u)- τ (v)| for all edges uvϵE(G). If τ *(E(G)) is a sequence of distinct consecutive square pyramidal numbers {M_1,M_2, …, M_k}, then the function τ is said to be square pyramidal graceful labeling and the graph which admits such a labeling is called a square pyramidal graceful graph. In this paper, some special results for square pyramidal graceful graphs is studied.
Źródło:
World Scientific News; 2021, 156; 147-160
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Note on the Total Detection Numbers of Cycles
Autorzy:
Escuadro, Henry E.
Fujie, Futaba
Musick, Chad E.
Powiązania:
https://bibliotekanauki.pl/articles/31339492.pdf
Data publikacji:
2015-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
vertex-distinguishing coloring
detectable labeling
detection number
total detection number
Hamiltonian graph
Opis:
Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . ., k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-vector code(v) = (a0, a1, . . ., ak−1), where ai is the number of edges incident with v that are labeled i for 0 ≤ i ≤ k − 1. The labeling c is called a detectable labeling if distinct vertices in G have distinct color codes. The value val(c) of a detectable labeling c of a graph G is the sum of the labels assigned to the edges in G. The total detection number td(G) of G is defined by td(G) = min{val(c)}, where the minimum is taken over all detectable labelings c of G. We investigate the problem of determining the total detection numbers of cycles.
Źródło:
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 237-247
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Targeting drug-efflux pumps - a pharmacoinformatic approach
Autorzy:
Pleban, Karin
Kaiser, Dominik
Kopp, Stefan
Peer, Michael
Chiba, Peter
Ecker, Gerhard
Powiązania:
https://bibliotekanauki.pl/articles/1041389.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
drug-efflux pumps
photoaffinity labeling
P-glycoprotein
self-organising maps
pharmacoinformatics
propafenone
Opis:
In line with our studies on propafenone-type inhibitors of P-glycoprotein (P-gp), we applied several methods to approach virtual screening tools for identification of new P-gp inhibitors on one hand and the molecular basis of ligand-protein interaction on the other hand. For virtual screening, a combination of autocorrelation vectors and selforganising artificial neural networks proved extremely valuable in identifying P-gp inhibitors with structurally new scaffolds. For a closer view on the binding region for propafenone-type ligands we applied a combination of pharmacophore-driven photoaffinity labeling and protein homology modeling. On LmrA, a bacterial homologue of P-gp, we were able to identify distinct regions on transmembrane helices 3, 5 and 6 which show significant changes in the labeling pattern during different steps of the catalytic cycle.
Źródło:
Acta Biochimica Polonica; 2005, 52, 3; 737-740
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Even Vertex Tetrahedral Mean Graphs
Autorzy:
Banu, A. Fathima
Chelliah, S.
Syed Ali Nisaya, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/1193397.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Tetrahedral number
even vertex tetrahedral mean graph
even vertex tetrahedral mean labeling
Opis:
The nth tetrahedral number is denoted by T_n and is of the form T_n = 1/6 n (n+1) (n+2). A graph G with p vertices and q edges is said to have an even vertex tetrahedral mean labeling if there exists an injective function f: V(G) →{0┤, 2, 4, . . . , 2T_q-2 , ├ 2T_q } such that the induced edge function f^*: E(G) →{T_1,T_(2 , . . .) ,T_q } defined by f^*(uv) = (f(u)+ f(v))/2 ∀ e=uv∈E(G) is a bijection. A graph which admits even vertex tetrahedral mean labeling is called an even vertex tetrahedral mean graph. In this paper, we introduce even vertex tetrahedral mean labeling and we prove that path, star, bistar, coconut tree, caterpillar, shrub, P_(m )@ P_n, banana tree, Y- tree and F-tree are even vertex tetrahedral mean graphs.
Źródło:
World Scientific News; 2021, 156; 26-39
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Special Graceful Labeling Results of Pentagonal Pyramidal Graceful Graphs
Autorzy:
Mahendran, S.
Powiązania:
https://bibliotekanauki.pl/articles/1193441.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Pentagonal pyramidal graceful number
pentagonal pyramidal graceful graphs
pentagonal pyramidal graceful labeling
Opis:
Numbers of the form (n^(2 ) (n+1))/2 for all n≥1 are called pentagonal pyramidal numbers. Let G be a graph with p vertices and q edges. Let Ψ : V(G) →{0, 1, 2… M_r} where M_r is the r^th pentagonal pyramidal number be an injective function. Define the function Ψ*:E(G) →{1,6,18,.., M_r} such that Ψ *(uv) = |Ψ (u)- Ψ (v)| for all edges uvϵE(G). If Ψ*(E (G)) is a sequence of distinct consecutive pentagonal pyramidal numbers {M_1,M_2, …, M_r}, then the function Ψ is said to be pentagonal pyramidal graceful labeling and the graph which admits such a labeling is called a pentagonal pyramidal graceful graph. In this paper, some special graceful labeling results of pentagonal pyramidal graceful graphs is studied.
Źródło:
World Scientific News; 2021, 157; 67-79
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dobrowolna ocena wyrobów prowadzona przez polskie i europejskie jednostki
Voluntary product evaluation conducted by Polish and European organizations
Autorzy:
Zboina, J.
Mroczko, G.
Powiązania:
https://bibliotekanauki.pl/articles/373900.pdf
Data publikacji:
2015
Wydawca:
Centrum Naukowo-Badawcze Ochrony Przeciwpożarowej im. Józefa Tuliszkowskiego
Tematy:
ocena wyrobów
certyfikacja
znakowanie wyrobów
wymagania
product evaluation
certification
product labeling
requirements
Opis:
Cel: Działalność jednostek certyfikujących wyroby w obszarze dobrowolnym nabiera z roku na rok coraz większego znaczenia. Jednostki krajowe i europejskie prowadzą tę działalność według określonych kryteriów i zasad wynikających m. in. z przepisów prawa, norm oraz wytycznych organów akredytujących i notyfikujących. Celem niniejszego artykułu jest przybliżenie przykładów praktyki wybranych jednostek certyfikujących w zakresie dobrowolnej certyfikacji wyrobów i jej znaczenia dla rynku wyrobów na przykładzie certyfikacji wyrobów budowlanych służących do ochrony przeciwpożarowej i innych. Wprowadzenie: W Polsce i Europie funkcjonują obowiązkowe systemy oceny wyrobów. Należy jednak zwrócić uwagę, że rynek wyrobów budowlanych, w tym stosowanych do ochrony przeciwpożarowej jest bardzo dynamiczny. Istnieje wiele wyrobów, których ocena według obowiązkowych systemów nie jest możliwa. Producenci takich wyrobów mają trudności ze sprzedażą swoich wyrobów, ponieważ nie mogą posłużyć się dokumentem, który potwierdzałby spełnienie przez wyrób określonych wymagań. W takiej sytuacji mają możliwość poddać wyrób ocenie w trybie dobrowolnym, która pozwoli zbudować do takiego wyrobu zaufanie. Uzyskany w drodze dobrowolnej oceny dokument może być przedstawiany razem z wyrobem, a sam wyrób może zostać oznakowany rozpoznawalnym w branży znakiem. Wnioski: Dobrowolnej oceny wyrobów dokonuje wiele jednostek krajowych i zagranicznych. Zauważyć można istotne podobieństwa jak i różnice w ich działalności, w tym między innymi w polityce dotyczącej znakowania wyrobów znakiem dobrowolnej certyfikacji. Pomimo różnic i podobieństw dokumenty wydawane w trybie dobrowolnym przez niezależne podmioty dostarczają uczestnikom rynku informacje o wyrobie, jak również umożliwiają podjęcie decyzji o wyborze i zakupie wyrobu. Dlatego zainteresowanie tą formą oceny wyrobów stosowanych w ochronie przeciwpożarowej stale wzrasta. Znaczenie dla praktyki: Możliwość dobrowolnej oceny wyrobów ma bardzo istotne znaczenie dla producentów i odbiorców wyrobów z punktu widzenia wprowadzania wyrobów do obrotu i potwierdzania posiadania przez nie odpowiednich właściwości, spełnienia określonych wymagań. Dlatego informacje w zakresie działalności różnych jednostek certyfikujących w tym obszarze, jak również możliwych znakowań wyrobów, są niezwykle cenne dla uczestników rynku wyrobów oraz stanowią ważne narzędzie w rękach projektantów, instalatorów, odbiorców i użytkowników wyrobów.
Aim: Activities of product certification bodies, performed on a voluntary basis, are increasingly gaining in importance from one year to the next. National and European organizations perform this activity in accordance with defined criteria and principles, which among others, stem from legal provisions, norms and guidelines provided by accreditation bodies. The purpose of this article is to present practical examples of voluntary certification of products for selected certification bodies and identification of significance for the manufacturing market, based on an example of certification of building materials used for fire protection and other products. Introduction: Obligatory product evaluation systems exist in Poland and Europe. It is pertinent to observe that the market for building construction materials, including products used for fire protection, is very dynamic. There are many products, which cannot be evaluated in accordance with obligatory systems. Manufacturers of such products have difficulties in selling their goods because they cannot make use of documents to confirm compliance with specified requirements. In order to build confidence in the product and the manufacturer, goods can be evaluated by one of the voluntary assessment systems. In this way a manufacturer can secure appropriate documentation and label the product with a symbol, which is recognized by the industry. Conclusion: Voluntary evaluation of products is carried out by many domestic and foreign organizations. It is possible to identify important similarities and differences in their activities including, amongst other things, policies relating to labeling of products with a voluntary certification symbol. Despite differences and similarities, documents issued by independent bodies through the voluntarily scheme provide information about the product to the market stakeholders, facilitating decisions and acquisition choice. That is why interest in this form of evaluation of products used in fire protection is constantly increasing. Implications for practice: The prospect of voluntary product assessment is very important for the producers and consumers from the standpoint of placing products on the market and assurance that products have appropriate properties to satisfy specific requirements. Therefore, information about activities of certification bodies in this area as well as the potential for product labeling is important for the market. These provide an important device for designers, installers, customers and users of products.
Źródło:
Bezpieczeństwo i Technika Pożarnicza; 2015, 4; 81-90
1895-8443
Pojawia się w:
Bezpieczeństwo i Technika Pożarnicza
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Detection of immunogold markers in images obtained from transmission electron microscopy
Autorzy:
Płaczek, B.
Bułdak, R. J.
Polaniak, R.
Matysiak, N.
Mielańczyk, Ł
Wojnicz, R.
Powiązania:
https://bibliotekanauki.pl/articles/333289.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
image processing
immunogold labeling
electron microscopy
przetwarzanie obrazu
barwienie immunozłotem
mikroskopia elektronowa
Opis:
In this paper a method is introduced which enables automatic detection of immunogold markers in transmission electron micrographs. Immunogold markers are used in electron microscopy to determine sub-cellular location of biological relevant macromolecules, such as proteins, lipids, carbohydrates, and nucleic acids. The proposed method combines image segmentation and feature localization approaches to improve accuracy of the immunogold markers detection in low contrast and highly textured image regions. A segmentation algorithm is intended in this study, which applies a flood-fill morphological operation. Accuracy of this method was evaluated by using electron microscopy images of human colorectal carcinoma cells. The experimental results show that the introduced method enables detection of immunogold markers with low false positive and false negative rates.
Źródło:
Journal of Medical Informatics & Technologies; 2014, 23; 111-117
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
RÓŻNORODNOŚĆ ŚRODKÓW AROMATYZUJĄCYCH, ICH SKŁAD CHEMICZNY A ZAPIS NA ETYKIETACH
Variety of food aromas, their chemical composition and labeling
Autorzy:
Jedlińska, Aleksandra
Witrowa-Rajchert, Dorota
Powiązania:
https://bibliotekanauki.pl/articles/439701.pdf
Data publikacji:
2017
Wydawca:
Akademia Finansów i Biznesu Vistula
Tematy:
technologia żywności
aromaty spożywcze
znakowanie żywności
food technology
food aromas
food labeling
Opis:
Dlaczego będąc przeziębionymi nie odczuwamy smaku potraw? Jaką rolę w odbiorze smaku odgrywa zmysł węchu? Dlaczego w przypadku pozostałych dodatków do żywności na etykiecie zapisane są konkretne nazwy związków chemicznych, ewentualnie ich nr „E”, a w przypadku aromatów spożywczych nie? Kiedy stosuje się zapis na etykiecie „naturalny aromat X z innymi naturalnymi aromatami”, kiedy „naturalny środek aromatyzujący X”, kiedy „naturalny aromat”, a kiedy „aromat”? Celem artykułu jest pokazanie znaczenia zmysłu węchu w obiorze wrażeń smakowo-zapachowych, omówienie składu chemicznego aromatów i ich zapisu na produktach spożywczych.
Why, when we have a cold, we don’t feel taste of food? What role does the sense of smell play in the perception of taste? Why in case of other food additives, names of specific chemical compounds, or their E number are written on the label, but in the case of food aromas it is not written? When on the label is used ‘natural aroma X with other natural aromas’ when ‘natural flavouring X’ when ‘natural aroma’ and when ‘aroma’? The aim of this article is to demonstrate the importance of the sense of smell in taste perception, discussion about chemical composition of food aromas and their record on food labels.
Źródło:
Kwartalnik Naukowy Uczelni Vistula; 2017, 2(52); 300-309
2084-4689
Pojawia się w:
Kwartalnik Naukowy Uczelni Vistula
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ocena poziomu satysfakcji pacjentów z etykietopiktogramów w aptece pilotażowej
Evaluation of the patients’ satisfaction on pharmaceutical pictogram provided in a Polish community pharmacy – pilot study
Autorzy:
Narożny, Adrianna
Zdanowski, Szymon
Świeczkowski, Damian
Jaguszewski, Miłosz
Krysiński, Jerzy
MERKS, PIOTR
Powiązania:
https://bibliotekanauki.pl/articles/762643.pdf
Data publikacji:
2020-06-15
Wydawca:
Polskie Towarzystwo Farmaceutyczne
Tematy:
piktogramy farmaceutyczne
etykietowanie
opieka farmaceutyczna
adherencja
pharmaceutical pictograms
labeling
pharmaceutical care
adherence
Opis:
Background: Pharmaceutical pictograms are useful tools aimed to improve patients’ understanding of medical information. They can be easily implemented into routine settings and can embrace various information, among others, about drug regimen, drug adverse reactions, and potentially harmful drug interactions. Since pharmaceutical pictograms can improve patients’ knowledge, they can also improve adherence to recommended therapy. Thus, it is wise to understand patients’ perspectives on pictograms, particularly due to the cultural discrepancies existing between populations in which pharmaceutical pictograms are used. Aim: The aim of the study was to collect patients’ perspectives particularly in terms of satisfaction on the pharmaceutical pictograms used in routine community pharmacy settings. Materials and methods: The study is immersed in a quantitative approach. The survey, based on an authorial questionnaire, was conducted in a single community pharmacy in the north part of Poland. Labeling was conducted by qualified professional staff according to validated recommendations provided via a computer system. 103 questionnaires were collected and analyzed. Only adult patients participated in the study. Results: Almost all participants (96.11%) acknowledged that such a labeling system could be helpful in following the physicians’ recommendations and can overall simplify the use of medicines. Additionally, 84.47% of patients stated that pictogram labels should be applied to both prescription and over-the-counter drugs. The vast majority (91.26%) also did agree that pharmaceutical pictograms should be available in every community pharmacy. Statistical analysis showed that patients who stated that pharmaceutical pictograms should be available in every community pharmacy and be provided on a patient demand were those for whom drug leaflets were not always understandable. Conclusions: Patients positively evaluated pharmaceutical pictograms. Further studies are warranted, particularly more representative in order to determine the most optimal direction for the development of pharmaceutical services in Poland.
Przedmiot badań: Piktogramy farmaceutyczne są przydatnym narzędziem ułatwiającym zrozumienie informacji medycznej przez pacjentów. Poprzez wzrost wiedzy pacjentów piktogramy farmaceutyczne mogą zwiększać stopień przestrzegania zaleceń terapeutycznych przez pacjentów. Poznanie perspektywy pacjentów jest istotne z uwagi na różnice kulturowe między populacjami, w których stosowane są piktogramy farmaceutyczne. Cel badania: Celem badania było zbadanie perspektywy pacjentów na piktogramy farmaceutyczne w szczególności satysfakcji pacjentów z usługi piktogramów farmaceutycznych dostępnych w aptece ogólnodostępnej. Materiał i metody: Badanie ankietowe zostało przeprowadzone w aptece ogólnodostępnej z udziałem pełnoletnich pacjentów (n=103), którzy otrzymali opakowania produktów leczniczych oznaczone piktogramami farmaceutycznymi. Leki były znakowane przez wykwalifikowany personel apteczny z użyciem oprogramowania komputerowego. W badaniu zastosowano autorski kwestionariusz. Wyniki: Prawie wszyscy badani (96,11%) uznali, że system etykietowania leków może być pomocny w realizacji zaleceń terapeutycznych oraz ułatwić korzystanie z leków, a 84,47% stwierdziło, że piktogramy farmaceutyczne powinny być naklejane na wszystkie leki dyspensowane w aptece. 91,26% respondentów wskazało, że taki system powinien znajdować się w każdej aptece. Zdania, że system etykietowania powinien wchodzić w zakres usługi apteki oraz że powinny być one udostępniane w każdej aptece na żądanie pacjenta były przede wszystkich osoby, dla których ulotki leków były nie zawsze zrozumiałe. Wnioski Piktogramy farmaceutyczne zostały ocenione przez pacjentów pozytywnie. Konieczne jest przeprowadzenie dalszych badań dotyczących piktogramów farmaceutycznych na liczniejszej grupie pacjentów w celu optymalizacji rozwoju opieki farmaceutycznej w Polsce.
Źródło:
Farmacja Polska; 2020, 76, 4; 185-194
0014-8261
2544-8552
Pojawia się w:
Farmacja Polska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Face Irregular Evaluations of Plane Graphs
Autorzy:
Bača, Martin
Ovais, Ali
Semaničová-Feňovčíková, Andrea
Suparta, I. Nengah
Powiązania:
https://bibliotekanauki.pl/articles/32319469.pdf
Data publikacji:
2022-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
plane graphs
irregular assignment
irregularity strength
face irregular labeling
face irregularity strength
Opis:
We investigate face irregular labelings of plane graphs and we introduce new graph characteristics, namely face irregularity strength of type (α,β,γ). We obtain some estimation on these parameters and determine the precise values for certain families of plane graphs that prove the sharpness of the lower bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2022, 42, 2; 549-568
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Beta-Number of Forests with Isomorphic Components
Autorzy:
Ichishima, Rikio
López, Susana-Clara
Muntaner-Batle, Francesc Antoni
Oshima, Akito
Powiązania:
https://bibliotekanauki.pl/articles/31342282.pdf
Data publikacji:
2018-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
beta-number
strong beta-number
graceful labeling
Skolem sequence
hooked Skolem sequence
Opis:
The beta-number, β(G), of a graph G is defined to be either the smallest positive integer n for which there exists an injective function f : V (G) → {0, 1, ..., n} such that each uv ∈ E (G) is labeled |f (u) − f (v)| and the resulting set of edge labels is {c, c+1, ..., c+|E(G)|−1} for some positive integer c or +∞ if there exists no such integer n. If c = 1, then the resulting beta-number is called the strong beta-number of G and is denoted by βs (G). In this paper, we show that if G is a bipartite graph and m is odd, then β (mG) ≤ mβ (G) + m − 1. This leads us to conclude that β (mG) = m|V(G)|−1 if G has the additional property that G is a graceful nontrivial tree. In addition to these, we examine the (strong) beta-number of forests whose components are isomorphic to either paths or stars.
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 3; 683-701
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fotografia w badaniach nad stygmą społeczną. Wnioski metodologiczne z badań nad stygmatyzacją osób, które popełniły przestępstwo
Photography in Social Stigma Research. Some Methodological Conclusions from Research on Criminals’ Stigmatization
Autorzy:
Chomczyński, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/1070725.pdf
Data publikacji:
2020-11-14
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
stigma
stigmatization
labeling
qualitative methods
in-depth interview
focus group interview
visual sociology
Opis:
The goal of this paper is to present some preliminary methodological conclusions from research on social stigmatization of people who served time in prisons. It mainly discusses some patterns that underlie the process of photography interpretation made by interviewees within the techniques of in-depth interview and focus group interview. To characterize the research tools, contexts and circumstances of research are indicated which are important for the understanding of the outcomes obtained. The results are based on an analysis of forty in-depth interviews and eight focus group interview sessions.As this article is methodological in character, the problem of stigmatization as a subject of social rese-arch is only indicated as a context of the analyses presented in this paper.
Źródło:
Studia Edukacyjne; 2017, 44; 177-194
1233-6688
Pojawia się w:
Studia Edukacyjne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Carotenoid - membrane interactions in liposomes: effect of dipolar, monopolar, and nonpolar carotenoids
Autorzy:
Wisniewska, Anna
Widomska, Justyna
Subczynski, Witold
Powiązania:
https://bibliotekanauki.pl/articles/1041203.pdf
Data publikacji:
2006
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
macular xanthophylls
β-cryptoxanthin
β-carotene
lutein
spin labeling
AMD
EPR
lipid bilayer
Opis:
Electron paramagnetic resonance (EPR) spin-labeling methods were used to study the effects of carotenoids on the physical properties of saturated phosphatidylcholine (PC) membranes to evaluate the contribution of the terminal hydroxyl groups of xanthophyll molecules to the carotenoid-membrane interaction. Effects of the dipolar, terminally dihydroxylated carotenoid lutein on membrane phase transition, fluidity, order, and polarity were compared with those of monopolar (β-cryptoxanthin) and nonpolar (β-carotene) carotenoids. These effects were monitored at the membrane center as a function of the amount of the carotenoid added to the sample and as a function of temperature for fluid-phase membranes. PC membranes with different thickness (from 12 to 22 carbons in alkyl chains) were used. Carotenoids shifted to lower temperatures and broadened the main phase transition of PC membranes. They decreased the membrane fluidity and increased the order of alkyl chains. Carotenoids also increased the hydrophobicity of the membrane interior. These effects were the strongest for lutein, significantly weaker for β-cryptoxanthin, and negligible for β-carotene. They decreased with the increase of the membrane thickness. Presented results suggest that anchoring of carotenoid molecules at the opposite membrane surfaces by polar hydroxyl groups is significant in enhancing their effects on membrane properties. This manuscript also shows the ability of EPR spin-labeling methods to monitor different membrane properties that can be applied in biotechnological studies with the use of liposomes.
Źródło:
Acta Biochimica Polonica; 2006, 53, 3; 475-484
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Etykietowanie - metoda wytwarzania elementów z tworzyw o specjalnych cechach powierzchni
Labeling - method of production of plastic parts with special surface properties
Autorzy:
Jachowicz, T.
Krasinskyi, V.
Powiązania:
https://bibliotekanauki.pl/articles/395366.pdf
Data publikacji:
2011
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
przetwórstwo tworzyw
wtryskiwanie
etykietowanie w formie
polymer processing
injection molding
In-Mold Labeling
Opis:
W artykule przedstawiono informacje na temat jednej ze specjalnych metod wtryskiwania, jakim jest wtryskiwanie z etykietowaniem w formie. Scharakteryzowano podstawy tej metody przetwórstwa i omówiono jej odmiany, uwzględniające różne sposoby pobierania i pozycjonowania etykiet w gnieździe formującym formy wtryskowej. Przedstawiono budowę stanowiska technologicznego do wtryskiwania z etykietowaniem w formie i wymieniono maszyny i urządzenia wchodzące w jego skład. Omówiono najważniejsze zalety i wady tej metody wtryskiwania oraz najważniejsze obszary zastosowania otrzymywanych przy jej pomocy wyprasek.
General information about one of special methods of injection molding, such as In-Mold Labeling have been presented in this article. Principles of this polymer processing method have been characterized. Also different ways of taking and positioning the labels into the mold have been described. Construction's details of injection station using In-Mold Labeling method have been presented also necessary machines and devices have been showed. Most important advantages and disadvantages of In-Mold Labeling method have been described as well with most important areas of application of plastic parts manufactured by this special method of injection molding.
Źródło:
Postępy Nauki i Techniki; 2011, 8; 201-210
2080-4075
Pojawia się w:
Postępy Nauki i Techniki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluative Categories of Action and Identity in Non-Evaluative Human Studies Research: Examples from Ethnomethodology
Autorzy:
Berard, Tim J.
Powiązania:
https://bibliotekanauki.pl/articles/2138934.pdf
Data publikacji:
2005-08-15
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
description
ethnomethodology
evaluation
Jeff Coulter
discrimination
labeling
Ludwig Wittgenstein
Peter Winch
schizophrenia
suicide
Opis:
Ethnomethodologists have emphasized the pragmatic and contextual nature of description as a variety of social practice, and have suggested the ramifications of this insight for the methodology and philosophy of the social sciences. However, ethnomethodologists have thereby invited difficult questions about the moral and analytic status of their own descriptions. Drawing on Atkinson’s study of suicide verdicts and Coulter’s writings on schizophrenia, ethnomethodological scholarship is shown to display the possibility and promise of disinterested description, even when the subject matter involves the evaluation of problematic actions and identities. The combination of Wittgensteinian logical grammar and empirical studies of natural language use, suggested by Coulter, is presented as especially relevant and remarkable for purposes of studying social practices including describing, naming, categorizing, classifying, labeling, diagnosing, reaching a verdict, and kindred practices of language use conceived as varieties of practical action.
Źródło:
Qualitative Sociology Review; 2005, 1, 1; 5-30
1733-8077
Pojawia się w:
Qualitative Sociology Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Management of packaging labeling technology in the context of improving the final product quality and work safety
Autorzy:
Knop, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/1830791.pdf
Data publikacji:
2021
Wydawca:
Stowarzyszenie Menedżerów Jakości i Produkcji
Tematy:
labeling technology
machine modernity
quality
safety
improvement
technologia etykietowania
nowoczesność maszyny
jakość
bezpieczeństwo
doskonalenie
Opis:
High demands on the aesthetics of the final product as well as sophisticated packaging shapes make the labeling process an operation that requires more and more precision and quality of workmanship. The quality of the labeling process is influenced mainly by the technology used, i.e. machinery and equipment, the knowledge, skills, and experience of operators, organization and working methods used, and by aspects related to proper maintenance. This article is a case study on the analysis and evaluation of the technology used in the process of labeling glass packaging and its impact on quality and work safety. The article aims to answer the question: does the labeling machine used by the surveyed company, due to the current portfolio of modernity of its parts and subassemblies, guarantee the realization of the labeling process at a high quality level and work safety. The article discusses in depth the factors influencing the quality of the process of labeling glass packaging in the studied company, paying attention to the issues related to the applied technology. ABC technology method was used to assess technology level and also indirectly safety level and Ishikawa diagram, L shape matrix diagram and affinity diagram to analyze and improve quality level. The article ends with a list of specific improvement actions to be taken to achieve the ultimate goal of managing the technology of glass packaging labeling - high quality of the final product resulting from the labeling process.
Źródło:
System Safety : Human - Technical Facility - Environment; 2021, 3, 1; 116-128
2657-5450
Pojawia się w:
System Safety : Human - Technical Facility - Environment
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bezpieczeństwo żywności a organizmy genetycznie modyfikowane. Instrumenty administracyjno–prawne
Food safety and genetic modified organisms – administrative law instruments
Autorzy:
Micińska-Bojarek, Magdalena
Powiązania:
https://bibliotekanauki.pl/articles/531064.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet w Białymstoku. Wydawnictwo Temida 2
Tematy:
food safety
genetically modified organisms (GMOs)
labeling
administrative law instruments
Cartagena protocol
safety clauses
Opis:
Food is one components of environment such as animals plants and mashrooms. In the second half of the 20th century industrialization and chemization of environment led to serious contamination of food chain In the 1990s, alongside conventional certain, foodstuffs contaminations was appear a new issue – genetic modified organisms (GMOs). Genetically modified organisms (GMOs) are organisms, such as plants and animals, whose genetic characteristics are being modified artificially in order to give them a new property. It is a completely new elements in food and feed, so it forced questions for legal instrument to entrench food and environmental safety. This article elaborate about discussion in science and controversial concerning bioengineering food and feed safety and shows certain law instruments to control GMOs issues in the international, european and national law.
Źródło:
Studia Iuridica Agraria; 2013, 11; 263-274
1642-0438
Pojawia się w:
Studia Iuridica Agraria
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Radio k-labelings for Cartesian products of graphs
Autorzy:
Kchikech, Mustapha
Khennoufa, Riadh
Togni, Olivier
Powiązania:
https://bibliotekanauki.pl/articles/743543.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph theory
radio channel assignment
radio k-labeling
Cartesian product
radio number
antipodal number
Opis:
Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that
$|f(x)-f(y)| ≥ k+1-d_G(x,y)$,
for any two vertices x and y, where $d_G(x,y)$ is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)-f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian product of two graphs, providing upper bounds on the radio k-chromatic number for this product. These results help to determine upper and lower bounds for radio k-chromatic numbers of hypercubes and grids. In particular, we show that the ratio of upper and lower bounds of the radio number and the radio antipodal number of the square grid is asymptotically [3/2].
Źródło:
Discussiones Mathematicae Graph Theory; 2008, 28, 1; 165-178
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Second order triangular graceful graphs
Autorzy:
Sakthi Sankari, R.
Syed Ali Nisaya, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/1193377.pdf
Data publikacji:
2021
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Second order triangular graceful graph
Second order triangular graceful labeling
Second order triangular number
Opis:
Let G=(V,E) be a graph with p vertices and q edges. A second order triangular graceful labeling of a graph G is an one to one function φ:V(G)→{0,1,2,…,B_q} where B_q is the qth second order triangular number, ie., B_q=1/6 q(q+1)(2q+1), that induces a bijection φ^*:E(G)→{B_1,B_2,…,B_q} of the edges of G defined by φ^* (uv) =|φ(u)-φ(v)| ∀ e=uv ∈E(G). A graph which admits such labeling is called a second order triangular graceful graph. In this paper, we introduce second order triangular graceful labeling and we prove that star, subdivision of star, nK_1,3, nK_2, bistar, path, comb, coconut tree, shrub and Y-tree are second order triangular graceful graphs.
Źródło:
World Scientific News; 2021, 155; 140-154
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Social Marginalization of People Living with a Mentally Ill Label–Family, Friends, and Work
Autorzy:
Maloušková, Kateřina
Fafejta, Martin
Powiązania:
https://bibliotekanauki.pl/articles/1395885.pdf
Data publikacji:
2021-07-31
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
mental illness
labeling
impairment
disability
organized deviant group
deviant career
family
friends
employment
marginalization
psychiatry
Opis:
This paper is based on qualitative research among people diagnosed with a mental illness who voluntarily attend a mental health center. Such individuals are given a degrading “mentally ill” label, which transforms them into a “new” person. This study showed that—due to their label—research participants are often socially marginalized—not only in the public but also in the private sphere. As members of an “organized deviant group” (the mental health center), they follow a “deviant career” and find a job outside the regular job market. Their marginalization is not only caused by their health problems (by their impairment), but they are also disabled through social reactions to these problems. Psychiatry based on the biological model of the disease cannot, therefore, help them without the cooperation of social science approaches dealing with social marginalization.
Źródło:
Qualitative Sociology Review; 2021, 17, 3; 76-89
1733-8077
Pojawia się w:
Qualitative Sociology Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improvement of the process of implementation of new product for European market - case study
Doskonalenie procesu wprowadzenia nowego produktu na rynek europejski - studium przypadku
Autorzy:
Zasadzień, M.
Nowrot, Z.
Powiązania:
https://bibliotekanauki.pl/articles/409785.pdf
Data publikacji:
2016
Wydawca:
STE GROUP
Tematy:
construction product
EU market
CE
harmonized standards
labeling
wyrób budowlany
rynek UE
normy zharmonizowane
znakowanie
Opis:
An inseparable element of intelligent processes is the effective use of knowledge gained from external sources and the ability to change under the influence of external factors. An example of this can be found in the process of introducing a new construction product to the EU market. It has to react to the ever-changing EU legislature and the national regulations that adapt to it. The frequently asked questions from manufacturers and importers indicate the necessity of creating a procedure that would allow for precisely explaining what the algorithm of the process looks like and what criteria must be met to introduce the new product into the construction product market. The complexity and multitude of regulations as well as the language barrier also cause other complications with the understanding of the process procedure of conduct. The graphical presentation of the algorithm should facilitate following the path of conduct in the case of introducing a new construction product into the EU market. The graphical form should allow for intuitive movement in the process and can constitute a basis for creating an interactive form.
Nieodłącznym elementem inteligentnych procesów jest skuteczne wykorzystywanie wiedzy zdobytej ze źródeł zewnętrznych i zdolność do zmian pod wpływem czynników zewnętrznych. Przykładem może być proces wprowadzania nowego wyrobu budowlanego na rynek krajów Unii Europejskiej. Musi on reagować na ciągle zmieniające się prawodawstwo unijne i dostosowujące się do niego przepisy krajowe. Często pojawiające się pytania producentów, importerów oraz dystrybutorów, wykazują iż niezbędne jest stworzenie procedury, która pozwoli na precyzyjne wyjaśnienie jak wygląda algorytm procesu i jakie kryteria należy spełnić aby wprowadzić nowy produkt na rynek wyrobów budowlanych. Zawiłość i mnogość przepisów prawnych, bariera językowa również powodują dodatkowe komplikacje w zrozumieniu schematu postępowania i poruszania się w procesie. Stworzona graficzna prezentacja algorytmu postępowania ma pomagać w śledzeniu ścieżki postępowania w przypadku wprowadzania nowego wyrobu budowlanego na rynek europejski. Postać graficzna powinna umożliwić intuicyjne poruszanie się w procesie i może stanowić podstawę do stworzenia interaktywnego formularza.
Źródło:
Management Systems in Production Engineering; 2016, 4 (24); 259-263
2299-0461
Pojawia się w:
Management Systems in Production Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Expression of the highly pathogenic porcine reproductive and respiratory syndrome virus (HP-PRRSV) in various types of cells in thymic tissues
Autorzy:
Liu, Q.
Yu, Y.-Y.
Wang, H.-Y.
Powiązania:
https://bibliotekanauki.pl/articles/16539177.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
pig
thymus
highly pathogenic porcine reproductive and respiratory syndromevirus
immunofluorescence double labeling method
target cells
Opis:
Thymus, an important central immune organ in pigs, is the site of T lymphocyte development and maturation and an important target organ for infection and replication of various pathogens. Highly pathogenic porcine reproductive and respiratory syndrome virus (HP-PRRSV) infection results in severe thymic atrophy in piglets. This study aimed to explore the effects of HP-PRRSV on the thymic structure of piglets to elucidate the pathogenesis of thymic atrophy induced by HP-PRRSV. In this study, histopathological techniques and immunofluorescence double staining techniques were used to analyze thymic tissues infected by HP-PRRSV to explore the structural changes of thymus caused by the viral infection and its target cell types. An antibody of cluster of differentiation (CD) 3 (CD3), CD20, CD80, or calgranulin + calprotectin was applied to identify T cells, B cells, dendritic cells (DCs), and macrophages, respectively. The results indicated that a variety of cell components in the thymic tissue were diffusely damaged after viral infection. In the infected thymic tissue, CD80- or calgranulin + calprotectin- -labeled cells supported the HP-PRRSV infection, whereas CD3-labeled T cells and CD20- -labeled B cells did not support the viral infection. The results showed that HP-PRRSV caused the reduction of visible cell components in the thymic tissue, and the virus attacked CD80- and calgranulin + calprotectin-positive cells (such as DCs and macrophages) in the thymic tissue, which played an important role in the pathogenesis of thymus atrophy. These results lay the foundation for elucidating the immunosuppression of piglets after infection with HP-PRRSV.
Źródło:
Polish Journal of Veterinary Sciences; 2022, 25, 2; 287-294
1505-1773
Pojawia się w:
Polish Journal of Veterinary Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wiedza konsumentek na temat informacji umieszczanych na kosmetykach
The consumers’ knowledge about information placed on cosmetics
Autorzy:
Wolniak, R.
Moskaluk-Grochowicz, A.
Powiązania:
https://bibliotekanauki.pl/articles/321474.pdf
Data publikacji:
2015
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
poziom świadomości
kosmetyki
konsumenci
informacja
znakowanie produktu
level of consciousness
cosmetics
consumers
information
product labeling
Opis:
Artykuł koncentruje się na prezentacji wyników badań dotyczących znajomości przez konsumentki oznakowań i symboli stosowanych na kosmetykach. Porównano w nim badania prowadzone na przestrzeni lat 2007- 2012.
The publication focuses on the presentation of research results concerning the knowledge of the consumer's signage and symbols used in cosmetics. It compared the studies conducted over the years 2007-2012.
Źródło:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska; 2015, 77; 279-290
1641-3466
Pojawia się w:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Julki, alternatywki, zodiakary. Stereotypy kobiet w młodomowie
Julki, Alternatywki, Zodiakary. Stereotypes of Women in Youth Speak
Autorzy:
Wileczek, Anna
Powiązania:
https://bibliotekanauki.pl/articles/2906556.pdf
Data publikacji:
2023-06-27
Wydawca:
Wydawnictwo HUMANICA
Tematy:
stereotyp
stereotyp kobiety
młodomowa
etykietowanie
etykiety
stereotype
stereotype of a woman
young speak
labeling
labels
Opis:
Artykuł dotyczy analizy współczesnych przykładów stereotypizacji (młodych) kobiet za pomocą nominacji o charakterze etykietalnym. Nowe etykiety (typu: bedoesiara, julka, karyna, konserwatywka, madka) są efektem ekspresywnych i waloryzujących uproszczeń poznawczych. Dominuje w nich element afektywny i humorystyczny, bowiem bazują one na określonych, emocjonalnych reakcjach na kontakt z tzw. jednostkami „typowymi” (por. typowa julka, typowa rzepiara, typowa madka). Wskazywane neologizmy, etykietując określone grupy osób, powielają i utrwalają w opinii społecznej negatywne i ‒ zwykle – deprecjonujące sądy, przyczyniając się do powstawania stereotypów.
The article analyzes contemporary examples of stereotyping of (young) women with the help of label nominations. The indicated neologisms, labeling particular groups of people, duplicate and consolidate in the social opinion negative and – usually – deprecating judgments, contributing to the formation of stereotypes. The new labels (such as bedoesiara, julka, karyna, konserwatywka, and madka) result from expressive and valorizing cognitive simplifications. An emotional and humorous element dominate them because they are based on specific, emotional reactions to contact with the so-called typical units (cf. typical julka, typical rzepiara, typical madka). These neologisms, by labelling given groups of people, reproduce and reinforce in social opinion negative and, usually, biased judgments, which results in new stereotypes.
Źródło:
Czasopismo Naukowe Instytutu Studiów Kobiecych; 2023, 1(14); 241-255
2451-3539
2543-7011
Pojawia się w:
Czasopismo Naukowe Instytutu Studiów Kobiecych
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Total H-Irregularity Strength of the Disjoint Union of Graphs
Autorzy:
Ashraf, Faraha
López, Susana Clara
Muntaner-Batle, Francesc Antoni
Oshima, Akito
Bača, Martin
Semaničová-Feňovčíková, Andrea
Powiązania:
https://bibliotekanauki.pl/articles/32083832.pdf
Data publikacji:
2020-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
H -covering
H -irregular labeling
total H -irregularity strength
copies of graphs
union of graphs
Opis:
A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and edges belonging to H. The total k-labeling is called the H-irregular total k-labeling of a graph G admitting an H-covering if all subgraphs of G isomorphic to H have distinct weights. The total H-irregularity strength of a graph G is the smallest integer k such that G has an H-irregular total k-labeling. In this paper, we estimate lower and upper bounds on the total H-irregularity strength for the disjoint union of multiple copies of a graph and the disjoint union of two non-isomorphic graphs. We also prove the sharpness of the upper bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 1; 181-194
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-100 z 118

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies