Amanto, Amanto and Wamiliana, Wamiliana and M Fajar, Nur Efendi (2018) THE NUMBER OF DISCONNECTED VERTEX LABELLED GRAPHS OF ORDER FIVE WITH MAXIMUM 3PARALEL EDGES IS SIX AND CONTAINS NO LOOPS. In: Konferensi Nasional Matematika 2018 Unibraw Malang, 2426 Juli 2018, Malang. (Submitted)

Text
The Number of disconnected ....KNM 2018 Malang.pdf Download (328kB)  Preview 
Abstract
Given n vertices and m edges, there are a lot of graphs that can be constructed, either connected or disconnected, simple or not simple. A graph is called connected if there is at least a path connecting every pair of vertices in that graph; and a graph is called simple if that graph does not contain any loops or parallel edges. In this paper will be discussed the number of disconnected vertex labeled graphs with order five without loops and the maximum allowable 3parallel edges is six.
Item Type:  Conference or Workshop Item (Paper) 

Subjects:  Q Science > QA Mathematics 
Divisions:  Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika 
Depositing User:  AMANTO 
Date Deposited:  03 Nov 2018 09:17 
Last Modified:  03 Nov 2018 09:17 
URI:  http://repository.lppm.unila.ac.id/id/eprint/9358 
Actions (login required)
View Item 