Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Lyra, Yulianti"'
Publikováno v:
Archives of Control Sciences, Vol vol. 30, Iss No 4, Pp 745-756 (2020)
In this paper we discuss the linear quadratic (LQ) optimization problem subject to fractional order irregular singular systems. The aim of this paper is to find the control-state pairs satisfying the dynamic constraint of the form a fractional order
Externí odkaz:
https://doaj.org/article/21970d656ab841f5b21daddbbff6ed79
Publikováno v:
Indonesian Journal of Combinatorics, Vol 5, Iss 2, Pp 82-93 (2021)
The locating-chromatic number was introduced by Chartrand in 2002. The locating chromatic number of a graph is a combined concept between the coloring and partition dimension of a graph. The locating chromatic number of a graph is defined as the card
Externí odkaz:
https://doaj.org/article/c07b8377fb74486b93a7e247bfee8462
Publikováno v:
Jurnal Hilirisasi IPTEKS, Vol 2, Iss 2, Pp 130-137 (2019)
Matematika merupakan bidang ilmu yang sangat penting namun kurang disukai oleh sebagian besar siswa. Ketidaksukaan ini disebabkan oleh kurang mempunyai mereka memahami pelajaran matematika. Untuk mengatasi hal tersebut sebagian siswa memilih belajar
Externí odkaz:
https://doaj.org/article/4add9dcd2cd9498c88a3805d9fe7b53e
Publikováno v:
Indonesian Journal of Combinatorics, Vol 2, Iss 1, Pp 50-56 (2018)
Let G = (V,E) be a connected graph. Let c be a proper coloring using k colors, namely 1, 2,·s, k. Let P={S1, S2,..., Sk} be a partition of V(G) induced by c and let Si be the color class that receives the color i. The color code, cP(v)=(d(v,S1), d(v
Externí odkaz:
https://doaj.org/article/cb5bc000e5e5432e83e5b782576e783c
Publikováno v:
Jambura Journal of Mathematics. 4:135-144
This article discusses the commutation matrix in the Kronecker quaternion group; that is, a non-abelian group whose 32 elements are matrices of 4 × 4 size, with entries in the set of complex numbers. The purpose of this paper is to describe the comm
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2018 (2018)
The locating chromatic number of a graph G is defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are
Externí odkaz:
https://doaj.org/article/3d048fb1b07b4a05a21dfd52b630dfd5
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
Publikováno v:
Jurnal Matematika UNAND. 12:55
Misalkan G adalah graf terhubung tak trivial dan didefinisikan pewarnaansisi pada graf G, yaitu p : E(G) → {1, 2, ..., n}; n ∈ N, dimana sisi yang bertetanggaboleh bewarna sama. Graf G dikatakan rainbow connected terhadap pewarnaan sisi p,jika G
Publikováno v:
Cybernetics and Physics. :192-197
In this article, the linear quadratic optimization problem subject to fractional order differential algebraic systems of Riemann-Liouville type is studied. The goal of this article is to find the optimal control-state pairs satisfying the dynamic con
Publikováno v:
Jurnal Matematika UNAND. 11:159
Let G = (V,E) is a connected graph and c is a k-coloring of G. The color class of G is the set of colored vertexs i, denoted by Ci for 1