Amanto, Amanto and Notiragayu, Notiragayu and Puri, F. C and Antoni, Yudi and Wamiliana, Wamiliana (2020) Counting the number of vertex labeled connected graphs of order five with minimum five edges and maximum ten parallel edges. Journal of Physics: Conference Series, 1524 (012047). pp. 1-7. ISSN Print : 1742-6588 Online : 1742-6596 (In Press)


Download (896kB) | Preview


If given a graph G(V,E) with n vertices and m edges many graphs can be constructed. The graphs constructed maybe connected graphs (there exists at least one path connecting every pair of vertices in the graph) or disconnected; either simple a (contains loop or parallel edges) or not simple. In ,this paper we will discuss the formula for counting the number of connected vertex labelled graph of order five (n=5) without loops, witof h minimum five edges and maa y contaiof n maximum ten parallel edges.

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika
Depositing User: WAMILIANA
Date Deposited: 07 Jul 2020 07:41
Last Modified: 07 Jul 2020 07:41

Actions (login required)

View Item View Item