mirage

Browsing Mathematics (PA-MTH) by Title

DSpace/Manakin Repository

Browsing Mathematics (PA-MTH) by Title

Sort by: Order: Results:

  • Hasmawati, Hasmawati; Jusmawati, Jusmawati (JMSK, 2013-01-17)
    The Ramsey number for a graph G versus a graph H, de- noted by R(G;H), is the smallest positive integer n such that for any graph F of order n, either F contains G as a subgraph or F con- tains H as a subgraph. In this ...
  • Hasmawati (2008-04-12)
    For given graphs G and H, the Ramsey number R(G, H) is the smallest natural number n such that for every graph F of order n: either F contains G or the complement of F contains H. This paper investigates the Ramsey number ...
  • Hasmawati, Hasmawati (2007-12-15)
    The Ramsey number for a graph G versus a graph H, de- noted by R(G;H), is the smallest positive integer n such that for any graph F of order n, either F contains G as a subgraph or F contains H as a subgraph. In this ...
  • Hasmawati (2008-04-12)
    The Ramsey number for a graph G versus a graph H, denoted by R(G, H), is the smallest positive integer n such that for any graph F of order n, either F contains G as a subgraph or F contains H as a subgraph. In this paper, ...
  • Baskoro, E.T; Hasmawati, Hasmawati; Assiyatun, Hilda (Discrete Mathematics, 2013-01-17)
    For given graphs G and H, the Ramsey number R(G,H) is the smallest natural number n such that for every graph F of order 9 n: either F contains G or the complement of F contains H. In this paper, we investigate the Ramsey ...
  • Hasmawati, . (2008-04-12)
    The upper bound of Ramsey numbers on complete bipartite graph was shown, namely R(K1,p,Kn,m ) m+2p-2. In this paper, we show that the Ramsey numbers R(K1,5,K2,5)=13. Furthermore, we show that R(K1,5,K2,m) = m+8 for odd ...
  • Bahri, Mawardi; Adji, Sriwulan; Zhao, Jiman (Acta Mathematica Sinica, 2011-02-15)
    We study the windowed Fourier transform in the framework of Clifford analysis, which we call the Clifford windowed Fourier transform (CWFT). Based on the spectral representation of the Clifford Fourier transform (CFT), ...
  • Amir, Amir Kamal (2012-03-28)
    Dalam paper ini akani diinvestigasi sifat ideal prima dari gelanggang polinom miring dalam kaitannya dengan notasi order kiri dan kanan.
  • Hasmawati (JMSK, 2013-01-17)
    For given graphs G and H; the Ramsey number R(G;H) is the smallest natural number n such that for every graph F of order n: either F contains G or the complement of F contains H: This paper investigates the Ramsey number ...
  • Azis, M. I. (Jurnal Matematika Universitas Negeri Malang, 2002-07)
  • Hasmawati, Hasmawati (Elektrikal Enjiniaring, 2013-01-17)
    Suatu bilangan k dikatakan nilai eigen matriks A, apabila terdapat vector u≠0, sehingga berlaku Au = ku. Jika graph G adalah graph k-reguler, maka k adalah suatu nilai eigen. Namun nilai eigen-nilai eigen yang lain belum ...
  • Hasmawati; Tri Baskoro, Edy; Assiyatun, Hilda (JCMCC, 2011-11-07)
    For given graphs G and H; the Ramsey number R(G;H) is the smallest natural number n such that for every graph F of order n: either F contains G or the complement of F contains H: This paper investigates the Ramsey number ...
  • Azis, M. I. (Jurnal Matematika, Statistika dan Komputasi, 2006-01)
    Suatu metode numerik ditemukan untuk menghitung kandungan air dalam tanah pada suatu sistim irigasi dimana volume air yang ditumpahkan diketahui. Teorinya didasarkan pada suatu asumsi bahwa kofisien konduksivitas hydrolik ...
  • Nur, Muh. (2012-06-28)
    Pada tulisan ini, akan dipelajari ruang norm-2 standar, yakni ruang hasil kali dalam yang dilengkapi dengan norm-2 standar. Setelah itu, ditunjukkan ekuivalensi antara norm baru yang diperoleh dari norm- 2 standar dan ...
  • Nurdin (2011-09-28)
    In [1], Baˇa et al. introduced the notion of a total edge and vertex irregular labelling. For a graph G, the weight of an edge xy, denoted by wt(xy), under a total labelling λ : V (G) ∪ E(G) → {1, 2, · · · , k} is the ...
  • Zakir, Muhammad; Hinding, Nurdin (Advances and Applications in Discrete Mathematics, 2011-07)
    For a simple graph G with the vertex set V and the edge set E, a labeling is called a vertex irregular total k-labeling of G, if for any two different vertices x and y in V, we have where The total vertex irregularit ...
  • Nurdin (2012-07-16)
    Caterpillar graph, total vertex irregularity strength, vertex irregular total labeling
  • Bahri, Mawardi; Ashino, Ryuichi (2011-11-09)
    Signal processing is a fast growing area today and the desired effectiveness in utilization of bandwidth and energy makes the progress even faster. Special signal processors have been developed to make it possible to ...
  • Bahri, Mawardi; Ashino, Ryuichi; Vaillancourt, Rémi (Applied Mathematics and Computation, 2011)
    In this paper we introduce the continuous quaternion wavelet transform (CQWT). We express the admissibility condition in terms of the (right-sided) quaternion Fourier transform. We show that its fundamental properties, ...
  • Bahri, Mawardi; Hitzer, Eckhard S.M.; Ashino, Ryuichi; Vaillancourt, Rémi (Applied Mathematics and Computation, 2010)
    In this paper, we generalize the classical windowed Fourier transform (WFT) to quaternion- valued signals, called the quaternionic windowed Fourier transform (QWFT). Using the spectral representation of the quaternionic ...

Search DSpace


Advanced Search

Browse

My Account