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-50 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ł
Wyświetlanie 1-50 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