Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Graceful labelling"'
Autor:
Miroslav Haviar, Katarina Kotuľová
Publikováno v:
Cubo, Vol 26, Iss 3, Pp 367-386 (2024)
We introduce and study an infinite family of graceful graphs, which we call kites. The kites are graphs where a path is joined with a graph "forming" a kite. We study and characterize three classes of the kites: kites formed by cycles known to be gra
Externí odkaz:
https://doaj.org/article/be48446301a94e96be467f231d0b75e4
Publikováno v:
Jisuanji kexue yu tansuo, Vol 15, Iss 11, Pp 2171-2183 (2021)
It is known that there are no polynomial quantum algorithms to solve some lattice difficult problems. Uncolored graphic lattice and colored graphic lattice are the products of multidisciplinary intersection inspired by lattice theory. A uncolored gra
Externí odkaz:
https://doaj.org/article/0866fc81c35e4941a683c184197f100f
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.
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:
Mathematics, Vol 11, Iss 16, p 3440 (2023)
Considering a fuzzy graph G is simple and can be connected and considered as a subset H=u1,σu1,u2,σu2,…uk,σuk, |H|≥2; then, every two pairs of elements of σ−H have a unique depiction with the relation of H, and H can be termed as a fuzzy re
Externí odkaz:
https://doaj.org/article/64751b8829744609b4fd346590bd1748
Autor:
M. Haviar, S. Kurtulík
Publikováno v:
Cubo, Vol 23, Iss 2, Pp 313-331 (2021)
The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory. The conjecture has caused a great interest in the study of gracefulness of simple
Externí odkaz:
https://doaj.org/article/759515383fe941cfa717f89b1dad9665
Autor:
S. N. Daoud, Ahmed N. Elsawy
Publikováno v:
Journal of Taibah University for Science, Vol 13, Iss 1, Pp 579-591 (2019)
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such th
Externí odkaz:
https://doaj.org/article/07fb8d923af8484e94fab633399cfb2e
Autor:
Christian Barrientos
Publikováno v:
Universal Journal of Mathematics and Applications, Vol 2, Iss 1, Pp 1-10 (2019)
Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number
Externí odkaz:
https://doaj.org/article/a068150de4c84dc29aa142013b280701
Autor:
Laxman Saha, Alamgir Basunia
Publikováno v:
Theory and Applications of Graphs, Vol 7 (2020)
Radio labelling problem of graphs have their roots in communication problem known as \emph{Channel Assignment Problem}. For a simple connected graph $G=(V(G), E(G))$, a radio labeling is a mapping $f \colon V(G)\rightarrow \{0,1,2,\ldots\}$ such that
Externí odkaz:
https://doaj.org/article/f4458b28855745f0821405c431037d90
Autor:
S.N. Daoud, Ahmed N. Elsawy
Publikováno v:
Journal of Taibah University for Science, Vol 12, Iss 3, Pp 315-330 (2018)
Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling if there is a bijection f from the edges of the graph to the set $\{2, 4,\ldots , 2q\}$ such that, when each vertex
Externí odkaz:
https://doaj.org/article/6b9504160d4445ae8eda81e2ca63b972