Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  graph labeling
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Product rosy labeling of graphs

100%
Fronček D.
Discussiones Mathematicae Graph Theory
|
2008
|
tom 28
|
nr 3
431-439
EN
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.
2
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

A note on strongly multiplicative graphs

100%
Adiga C., Ramaswamy H., Somashekara D.
Discussiones Mathematicae Graph Theory
|
2004
|
tom 24
|
nr 1
81-83
EN
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].
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Some totally modular cordial graphs

80%
Cahit I.
Discussiones Mathematicae Graph Theory
|
2002
|
tom 22
|
nr 2
247-258
EN
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.
4
Content available remote

The Smallest Non-Autograph

80%
Baumer B. S., Wei Y., Bloom G. S.
Discussiones Mathematicae Graph Theory
|
2016
|
tom 36
|
nr 3
577-602
EN
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.
5
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

On total vertex irregularity strength of graphs

80%
Muthu Guru Packiam K., Kathiresan K.
Discussiones Mathematicae Graph Theory
|
2012
|
tom 32
|
nr 1
39-45
EN
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.
6
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Value sets of graphs edge-weighted with elements of a finite abelian group

80%
DuCasse E., Gargano M., Quintas L.
Discussiones Mathematicae Graph Theory
|
2010
|
tom 30
|
nr 1
5-15
EN
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.
7
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Generalized graph cordiality

80%
Pechenik O., Wise J.
Discussiones Mathematicae Graph Theory
|
2012
|
tom 32
|
nr 3
557-567
EN
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.
8
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Trees with α-labelings and decompositions of complete graphs into non-symmetric isomorphic spanning trees

70%
Kubesa M.
Discussiones Mathematicae Graph Theory
|
2005
|
tom 25
|
nr 3
311-324
EN
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.
9
Content available remote

Union of Distance Magic Graphs

51%
Cichacz S., Nikodem M.
Discussiones Mathematicae Graph Theory
|
2017
|
tom 37
|
nr 1
239-249
EN
A distance magic labeling of a graph G = (V,E) with |V | = n is a bijection ℓ from V to the set {1, . . . , n} such that the weight w(x) = ∑y∈NG(x) ℓ(y) of every vertex x ∈ V is equal to the same element μ, called the magic constant. In this paper, we study unions of distance magic graphs as well as some properties of such graphs.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.