Arsyad, Ardy; Djamaluddin, Abdur Rahman; Thaha, Arsyad; Harianto, Tri; Samang, Lawalenna(University of Parahyangan Bandung, 2013-06-02)
It is widely accepted that soil investigation conducted in construction projects is limited. The scope of soil investigation is dictated by budget allocation rather than the proper need of characterizing soil properties. ...
Rahman, S., Mano, A. and Udo, K., 2013. Quasi-2D Sediment Transport Model Combined with Bagnold-type Bed
Load Transport. In: Conley, D.C., Masselink, G., Russell, P.E. and O’Hare, T.J. (eds.), Proceedings 12th ...
In the previous paper [7], we proposed the two-dimensional continuous
quaternion wavelet transform (CQWT). In the present paper,
using the orthogonality of harmonic exponential functions we give an
alternative proof for ...
Penelitian dengan Judul “Quo Vadis Pendaftaran Tanah”. Dipilihnya Quo Vadis Pendaftaran Tanah sebagai fokus penelitian mengingat bahwa Fokus pemerintah terhadap pelaksanaan pendaftaran tanah ini telah dianggap sebagai suatu ...
Penelitian ini berjudul “Ragam Bahasa Perawat Kesehatan (Paramedis) di Kota Makassar: Tinjauan Psikososiolinguistik merupakan penelitian interdisipliner yaitu linguistik (ilmu bahasa) psikologi, dan sosiologi. Perawat ...
Azmy, M. Fathien(Prosiding Hasil Penelitian Fakultas Teknik Unhas, 2010-12)
Tuntutan kebutuhan pada pusat perbelanjaan perlu dibarengi ketersediaan sarana yang memadai untuk mencapai satu titik ke titik yang lain dengan mengedepankan azas kemudahan, azas keselamatan, azas kemandirian, dan azas ...
Abstract. 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 ...
Hasmawati, Hasmawati(Journal of The Indonesian Mathematcal Society, 2012-11-21)
Abstract. 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 ...
The Ramsey numbers 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. The upper ...
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 ...
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 ...
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 ...
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, ...
Abstract. 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 ...
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 ...
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 ...