cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Lyra Yulianti
Contact Email
lyra@sci.unand.ac.id
Phone
-
Journal Mail Official
lyra@si.unand.ac.id
Editorial Address
http://jmua.fmipa.unand.ac.id/index.php/jmua/index
Location
Kota padang,
Sumatera barat
INDONESIA
Jurnal Matematika UNAND
Published by Universitas Andalas
ISSN : 2303291X     EISSN : 27219410     DOI : -
Core Subject : Science, Education,
Computer Science & IT Mathematics
Fokus dan Lingkup dari Jurnal Matematika FMIPA Unand meliputi topik-topik dalam Matematika sebagai berikut : Analisis dan Geometri Aljabar Matematika Terapan Matematika Kombinatorika Statistika dan Teori Peluang.
Arjuna Subject : -
Articles 13 Documents
 1   2 
Search results for , issue "Vol 2, No 1 (2013)" : 13 Documents clear
SUATU KAJIAN TITIK TETAP PEMETAAN k-PSEUDONONSPREADING SEJATI DI RUANG HILBERT Desi Rahmadani
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.52-60.2013

Abstract

Let C be a subset of a real Hilbert space H. Let T : H ! H be a strictlyk-pseudononspreading mapping with a nonempty xed point set. Let ! 2 [k; 1) be xed.Let fTigNi=1be N k-strictly pseudononspreading mappings. In this paper, we study therelationship between of a xed point set of a k-strictly pseudononspreading mapping andother forms of certain combinations of some k-strictly pseudononspreading mappings inHilbert space.
PELABELAN TOTAL SISI A JAIB PADA GRAF BINTANG Dina Irawati
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.85-89.2013

Abstract

Misalkan G adalah suatu graf dengan himpunan titik V(G) dan himpunan sisi E(G).Banyaknya titik di G adalah p dan banyaknya sisi di G adalah q. Suatu graf G adalahtotal sisi ajaib jika terdapat pemetaan bijektif λ dari V(G) ∪ E(G) ke himpunan{1, 2, ..., p+q} sedemikian sehingga untuk setiap sisi xy di G berlaku λ(x)+λ(xy)+λ(y) =k, k adalah konstan. Pada jurnal ini penulis mengkaji tentang pelabelan total sisi ajaibpada graf bintang.
BILANGAN KROMATIK LOKASI UNTUK JOIN DARI DUA GRAF Yuli Erita
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.23-31.2013

Abstract

Let f be a proper k-coloring of a connected graph G and = (V) bean ordered partition of V (G) into the resulting color classes. For a vertex v of G, thecolor code of v with respect to is dened to be the ordered k-tuplec(v) = (d(v; V1); d(v; V2); :::; d(v; V));where d(v; Vi) = minfd(v; x)jx 2 Vikg, 1 i k: If distinct vertices have distinct colorcodes, then f is called a locating coloring. The minimum number of colors needed in alocating coloring of G is the locating chromatic number of G, and denoted by (G). Inthis paper, we study the locating chromatic number of the join of some graphs.
PELABELAN TOTAL ( a, d) -TITIK ANTIAJAIB SUPER PADA GRAF PETERSEN P(n, 2) DENGAN N GANJIL, N ≥ 5 Rido Aman
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.61-64.2013

Abstract

Penelitian ini bertujuan mengkaji kembali tentang pelabelan total ( a, d)-titikantiajaib super pada Graf Petersen P(n, 2) dengan n ganjil, n ≥ 5. Fokus pengkajiandiutamakan pada pembentukan pola pelabelan total (a, d)-titik-antiajaib super padaGraf Petersen P(n, 2) dengan n ganjil (n ≥ 5).
PELABELAN TOTAL (a; d)-SISI ANTIAJAIB SUPER PADA K 1;m [ K 1;n untuk d = 1 atau d = 2 Dina Yelni
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.32-36.2013

Abstract

Misalkan G adalah suatu graf dengan banyaknya titik p dan banyaknya sisi q.Pelabelan total (a; d)-sisi antiajaib dari graf G adalah suatu fungsi bijektif f : (V (G) [E(G) ! f1; 2; 3; ; p + qg sehingga bobot sisi w(u; v) = f(u) + f(v) + f(uv) denganuv 2 (G) membentuk barisan aritmatika dengan suku awal a dan beda d. Suatu pelabelantotal dari graf G dikatakan super jika f(V ) = f1; 2; 3; ; pg. Dalam paper ini, pelabelanyang dibahas adalah pelabelan pada gabungan dua graf bintang K, untukm n 2.
PENYELESAIAN MASALAH KONTROL KUADRATIK LINIER YANG MEMUAT FAKTOR DISKON Mezi Fauziatul Husna
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.65-71.2013

Abstract

The linear quadratic control problem is an optimal control problem whichhas been used in various fields. In this paper, we will study the solving of linear quadraticcontrol problem that contains a discount factor. By using the change of variables technique, some sufficient condition for the existence of optimal control is determined. Someexamples are also presented.
STABILISASI SISTEM DESKRIPTOR LINIER KONTINU Yulian Sari
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.1-5.2013

Abstract

Kajian tentang kestabilan sistem deskriptor linier kontinu merupakan topikklasik yang telah dikaji oleh berbagai peneliti. Pada paper ini akan diulas kembali tentangkriteria kestabilan dan stabilisasi sistem deskriptor linier kontinu. Metode dekomposisistandar akan digunakan pada pembahasan selanjutnya. Algoritma memilih kontrol feedbackpada masalah stabilisasi sistem deskriptor linier kontinu akan diberikan pada akhirtulisan.
PELABELAN TOTAL (a; d)-SISI ANTIAJAIB SUPER PADA GRAF RODA Wn Heru Permana
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.37-41.2013

Abstract

Misalkan terdapat graf G = (V; E). Suatu pemetaan bijeksi g dari V (G)[E(G)ke f1; 2; ; jV (G)j + jE(G)jg dikatakan pelabelan total (a; d)-sisi antiajaib di G, jikahimpunan bobot sisi W(xy) = fw(xy) j w(xy) = g(x)+g(y)+g(xy); 8xy 2 E(G)g, dapatdinyatakan sebagai barisan aritmatika dengan suku awal a dan beda d. Pelabelan total(a; d)-sisi antiajaib dikatakan pelabelan total (a; d)-sisi antiajaib super jika g(V (G)) =f1; 2; ; jV (G)jg. Pada makalah ini akan dikaji kembali tentang pelabelan total (a; d)sisiantiajaib pada graf roda Wndengan n + 1 titik.
THE EFFECT OF DELAYED TIME OF OSCILLATION IN THE LOGISTIC EQUATION Ivone Lawrita; Efendi .; Ahmad Iqbal Baqi
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.72-77.2013

Abstract

Time delay logistic equation is a modification of the logistic equation. Theequation logistic delay time can affect the increase and decrease in population. This leadsto oscillations in the equation. The purpose of this research is to study the oscillation ofthe logistic equation with time delays.
BILANGAN KROMATIK LOKASI UNTUK GRAF AMALGAMASI BINTANG Fadhilah Syamsi
Jurnal Matematika UNAND Vol 2, No 1 (2013)
Publisher : Jurusan Matematika FMIPA Universitas Andalas Padang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25077/jmu.2.1.6-13.2013

Abstract

Let G = (V; E) be a connected graph and c a coloring of G. For i = 1; 2; :::; k,we dene the color classes Cias the set of vertices receiving color i. The color code c(v)of a vertex v 2 V (G) is the k-vector (d(v; C1); d(v; C2); :::; d(v; Ck)), where d(v; C) isthe distance between v and C. If all vertices of G have distinct color codes, then c iscalled a locating-coloring of G. The locating-coloring number of graph G, denoted byLi(G), is the smallest positive integer k such that G has a locating coloring with k color.Let K1;nibe star, where niis the number of leaves of each star K. We dene thevertex amalgamation of star, denoted by Sk;(n1;:::;nk)1;n, as a graph obtained from starsKby identifying one arbitrary leaf from each star. We dene the edge amalgamationof star, denoted by S1;nik;(n, as a graph obtained by uniting an edge of each star.If ni1;:::;nk)= m for each i, then we denoted the vertex amalgamation of star as Sandthe edge amalgamation of star as Sk;m. In this paper we discuss the locating coloring ofSk;(n1;:::;nk)and Sk;(n1;:::;nk).

Page 1 of 2 | Total Record : 13

 1   2 

Filter by Year

2013 2013


Reset
Filter By Issues
All Issue Vol 12, No 1 (2023) Vol 11, No 4 (2022) Vol 11, No 3 (2022) Vol 11, No 2 (2022) Vol 11, No 1 (2022) Vol 10, No 4 (2021) Vol 10, No 3 (2021) Vol 10, No 2 (2021) Vol 10, No 1 (2021) Vol 9, No 4 (2020) Vol 9, No 3 (2020) Vol 9, No 2 (2020) Vol 9, No 1 (2020) Vol 8, No 4 (2019) Vol 8, No 3 (2019) Vol 8, No 2 (2019) Vol 8, No 1 (2019) Vol 7, No 4 (2018) Vol 7, No 3 (2018) Vol 7, No 2 (2018) Vol 7, No 1 (2018) Vol 6, No 4 (2017) Vol 6, No 3 (2017) Vol 6, No 2 (2017) Vol 6, No 1 (2017) Vol 5, No 4 (2016) Vol 5, No 3 (2016) Vol 5, No 2 (2016) Vol 5, No 1 (2016) Vol 4, No 4 (2015) Vol 4, No 3 (2015) Vol 4, No 2 (2015) Vol 4, No 1 (2015) Vol 3, No 4 (2014) Vol 3, No 3 (2014) Vol 3, No 2 (2014) Vol 3, No 1 (2014) Vol 2, No 4 (2013) Vol 2, No 3 (2013) Vol 2, No 2 (2013) Vol 2, No 1 (2013) Vol 1, No 2 (2012) Vol 1, No 1 (2012) Vol 1, No 1 (2012) More Issue