Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Prism graph"'
Autor:
Zbigniew R. Bogdanowicz
Publikováno v:
Discrete Mathematics Letters, Vol 13, Pp 66-73 (2024)
Externí odkaz:
https://doaj.org/article/84a88f8f77de4c4b90cd1ff42e428aba
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 19, Iss 3, Pp 276-281 (2022)
AbstractThe distance matrix of a simple connected graph G is [Formula: see text] where dij is the length of a shortest path between the ith and jth vertices of G. Eigenvalues of D(G) are called the distance eigenvalues of G. The m-generation n-prism
Externí odkaz:
https://doaj.org/article/388ef327ba4a4a30a1eec9f1420313c0
Autor:
Indrawati Lihawa, Sumarno Ismail, Isran K Hasan, Lailany Yahya, Salmun K Nasib, Nisky Imansyah Yahya
Publikováno v:
Jambura Journal of Mathematics, Vol 4, Iss 1, Pp 145-151 (2022)
Rainbow vertex-connection number is the minimum k-coloring on the vertex graph G and is denoted by rvc(G). Besides, the rainbow-vertex connection number can be applied to some special graphs, such as prism graph and path graph. Graph operation is a m
Externí odkaz:
https://doaj.org/article/c8a51a61ad684c91aae4aa2deda34326
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:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 3, Pp 148-153 (2021)
In recent article, Zhou and Zhou conjectured that among cubic circulant graphs with n vertices the maximum energy occurs whenever the largest number of components is attained. In this article, first we compute the upper and lower bounds for the energ
Externí odkaz:
https://doaj.org/article/0dc90c97fa1c4d6cbb8eacd33ee7fdf2
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 1, Pp 11-16 (2021)
Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative intege
Externí odkaz:
https://doaj.org/article/e5e5e9aeb02044c1ade5b490ae795244
Autor:
Alper Bulut, Ilhan Hacioglu
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 18, Iss 1, Pp 25-28 (2021)
In this article, we compute the oblique asymptote of the energy function for all connected cubic circulant graphs. Moreover, we show that this oblique asymptote is an upper bound for the energies of two of the subclasses of Möbius ladder graphs and
Externí odkaz:
https://doaj.org/article/cb4f43e184ae40faa6bc6ef3bbaf64ed
Publikováno v:
AIMS Mathematics, Vol 5, Iss 6, Pp 6609-6619 (2020)
Let $G=(V(G),E(G))$ be a graph. An ordered set of vertices $\Re=\{v_1,v_2,\ldots,v_l\}$ is a $2-$resolving set for $G$ if for any distinct vertices $s,w \in V(G)$, the representation of vertices $r(s|\Re)=(d_G(s,v_1),\ldots,d_G(s,v_l))$ and $r(w|\Re)
Externí odkaz:
https://doaj.org/article/28f5cf744d9f4e2dbbbb88ab347b5771
Publikováno v:
Symmetry, Vol 15, Iss 2, p 521 (2023)
The vertex coloring of graphs is a well-known coloring of graphs. In this coloring, all of the vertices are assigned colors in such a way that no two adjacent vertices have the same color. We can call this type of coloring P2 coloring, where P2 is a
Externí odkaz:
https://doaj.org/article/06ba7e81ea4a4e52933d718fc01fe862
Autor:
Mohamed R. Zeen El Deen
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 27, Iss 1, Pp 1-15 (2019)
Abstract Edge even graceful labeling is a new type of labeling since it was introduced in 2017 by Elsonbaty and Daoud (Ars Combinatoria 130:79–96, 2017). In this paper, we obtained an edge even graceful labeling for some path-related graphs like Y-
Externí odkaz:
https://doaj.org/article/3b58ee72da7f455981fbebfe1289dde9