Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Sirirat Singhun"'
Publikováno v:
Songklanakarin Journal of Science and Technology (SJST), Vol 43, Iss 2, Pp 331-334 (2021)
Let 𝐻 be a hypergraph with a vertex set 𝑉 and a hyperedge set 𝐸. Generalized from the super edge-magic in a graph, we say that a hypergraph 𝐻 is super edge-magic if there is a bijection 𝑓: 𝑉 ∪ 𝐸 → {1,2,3, … , |𝑉| + |
Externí odkaz:
https://doaj.org/article/c57c3f5baaef4dc9a4502c25203374e2
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 911-914 (2020)
We define three large families of graphs which contain and respectively as subfamily. Necessary and sufficient conditions for those graphs in these three large families whose squares are panconnected are determined.
Externí odkaz:
https://doaj.org/article/765161ac396a4e4f9246f3342372a859
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 296-302 (2020)
A -knight’s move on the cylinder chessboard is the move of the knight 2 squares vertically or 2 squares horizontally and then 3 squares perpendicular to it. In this paper, we show a closed -knight’s tour on the cylinder chessboard for all positiv
Externí odkaz:
https://doaj.org/article/d13cc93e4b3a476aa3184663dd41b294
Publikováno v:
Journal of Mathematics, Vol 2021 (2021)
The circumference of a graph G is the length of a longest cycle in G, denoted by cirG. For any even number n, let cn = min {cirG|G is a 3-connected cubic triangle-free plane graph with n vertices}. In this paper, we show that an upper bound of cn is
Externí odkaz:
https://doaj.org/article/c925828158b24d499c18e251ed9ce8c1
Publikováno v:
Symmetry, Vol 14, Iss 4, p 816 (2022)
A side skirt is a planar rooted tree T, T≠P2, where the root of T is a vertex of degree at least two, and all other vertices except the leaves are of degree at least three. A reduced Halin graph or a skirted graph is a plane graph G=T∪P, where T
Externí odkaz:
https://doaj.org/article/37138453717a47b8bc77ecd4f26fc605
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 3, Pp 218-229 (2016)
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-magic labeling of hypergraphs. For a hypergraph H with a finite vertex set V and a hyperedge set E, a bijective function f:V∪E→{1,2,3,…,|V|+|E|}
Externí odkaz:
https://doaj.org/article/421ea28567f943aeb9ac3026cf13878b
Publikováno v:
Symmetry, Vol 12, Iss 8, p 1217 (2020)
A (legal) knight’s move is the result of moving the knight two squares horizontally or vertically on the board and then turning and moving one square in the perpendicular direction. A closed knight’s tour is a knight’s move that visits every sq
Externí odkaz:
https://doaj.org/article/afbc22847b964d75b5d4e290d8574332
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 24:2001-2016
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22ae2befa084ce2fcb5d0bf86aa2104d
https://doi.org/10.1080/09720529.2021.1925450
https://doi.org/10.1080/09720529.2021.1925450
Publikováno v:
Journal of Discrete Mathematical Sciences and Cryptography. 25:53-72
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c77201e6a7adf8b4808a1d24c92a54ab
https://doi.org/10.1080/09720529.2021.1925448
https://doi.org/10.1080/09720529.2021.1925448
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 911-914 (2020)
We define three large families of graphs which contain and respectively as subfamily. Necessary and sufficient conditions for those graphs in these three large families whose squares are panconnected are determined.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c24f81f22c218759da5aae5b04d34f2
https://doi.org/10.1016/j.akcej.2020.02.002
https://doi.org/10.1016/j.akcej.2020.02.002