The relationship of the formulas for the number of connected vertices labeled graphs with order five and order six without loops von Amanto, Amanto, Notiragayu, Notiragayu, Zakaria, La, Wamiliana, Wamiliana

Volltext

Bilangan Kromatik Lokasi Graf Split Lintasan von Rahmatalia, Siti, Asmiati, Asmiati, Notiragayu, Notiragayu

Volltext

The Implementationof Digital Text Coding Algorithm Through A Three Dimensional Mapping Derived From Generalized ΔΔ-mKdV Equation Using Mathematica von Notiragayu, Zakaria, L

Volltext

The comparison of the effectiveness of the lowest supply lowest cost (LSLC) algorithm and the exponential approach algorithm in transportation problems von Tresya Carmela Purba, Notiragayu Notiragayu, Fitriani Fitriani, Dorrah Azis

Volltext

Calculating the Number of vertices Labeled Order Six Disconnected Graphs which Contain Maximum Seven Loops and Even Number of Non-loop Edges Without Parallel Edges von Pertiwi, F A, Amanto, Wamiliana, Asmiati, Notiragayu

Volltext

Bilangan Kromatik Lokasi Graf Split Lintasan von Siti Rahmatalia, Asmiati Asmiati, Notiragayu Notiragayu

Volltext

Counting the number of vertexes labeled connected graphs of order five with minimum five edges and maximum ten parallel edges von Amanto, Notiragayu, Puri, F C, Antoni, Y, Wamiliana

Volltext

The Locating Chromatic Number for Split Graph of Cycle von Prawinasti, K, Ansori, M, Asmiati, Notiragayu, G N Rofi, AR

Volltext