Zobrazeno 1 - 10
of 135
pro vyhledávání: '"Graceful graph"'
Autor:
唐保祥(TANG Baoxiang), 任韩(REN Han)
Publikováno v:
Zhejiang Daxue xuebao. Lixue ban, Vol 51, Iss 2, Pp 178-185 (2024)
For a positive integer n≥2, what is the minimum number of ticks to be engraved on an unscaled ruler of length n to measure all lengths from 1 to n. This is an unsolved problem of ruler with least number of scales. This paper clarifies the relations
Externí odkaz:
https://doaj.org/article/d595e0ba169b415599452fe114ebeeb9
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 20, Iss 3, Pp 300-307 (2023)
AbstractLet [Formula: see text] be a signed graph of order p and size q. Let [Formula: see text] and [Formula: see text] Let [Formula: see text] be an injective function and let [Graphic: see text]gf(uv)={|f(u)−f(v)| if uv∈E+f(u)+f(v) if uv∈E
Externí odkaz:
https://doaj.org/article/e03fef87c8f14a5c8f3b4353202bc908
Autor:
V Akshaya
Publikováno v:
Ratio Mathematica, Vol 51, Iss 0 (2024)
Let G be a graph with p vertices and q edges. Define a bijection f : V (G) → {1, 8, ..., p(3p - 2)} by f(vi) = i(3i - 2) for every i from 1 to p and define a 1 - 1 mapping fopgl ∗ : E(G) → set of natural number N such that f∗(uv) = |f(u) - f(
Externí odkaz:
https://doaj.org/article/948ccbd063b945a99dae27d88751f3fd
Autor:
A Rama Lakshmi, M P Syed Ali Nisaya
Publikováno v:
Ratio Mathematica, Vol 44, Iss 0, Pp 9-14 (2022)
Let be a graph with vertices and edges. Let andbe the vertex set and edge set of respectively. A polygonal graceful labeling of a graph is an injective function , where is a set of all non-negative integers that induces a bijection , where is the pol
Externí odkaz:
https://doaj.org/article/60e86578a5024673aacc94f189533fef
Autor:
Christian Barrientos
Publikováno v:
Theory and Applications of Graphs, Vol 9, Iss 2, Pp 1-16 (2022)
A graceful labeling of a bipartite graph is an \a-labeling if it has the property that the labels assigned to the vertices of one stable set of the graph are smaller than the labels assigned to the vertices of the other stable set. A concatenation of
Externí odkaz:
https://doaj.org/article/f0b87bbf2a7047a79a3ddd083f033979
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theory and Applications of Graphs, Vol 9, Iss 2 (2022)
For $G$ a simple, connected graph, a vertex labeling $f:V(G)\to \Z_+$ is called a \emph{radio labeling of $G$} if it satisfies $|f(u)-f(v)|\geq\diam(G)+1-d(u,v)$ for all distinct vertices $u,v\in V(G)$. The \emph{radio number of $G$} is the minimal s
Externí odkaz:
https://doaj.org/article/8c25c684f8f24d7abc0e30ba466b85c8
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 7-15 (2021)
We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers. We show t
Externí odkaz:
https://doaj.org/article/499bfee6ac5f40a1a537d7216e383090
Autor:
Christian Barrientos
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 8, Iss 2, Pp 301-317 (2020)
Graceful labelings are an effective tool to find cyclic decompositions of complete graphs and complete bipartite graphs. The strongest kind of graceful labeling, the α-labeling, is in the center of the research field of graph labelings, the existenc
Externí odkaz:
https://doaj.org/article/e8d90e9dabbf420fb599277909675c65
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.