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