Amanto, Amanto and Notiragayu, Notiragayu and Fadila Cahya, Puri and Yudi, Antoni and Wamiliana, Wamiliana (2019) Counting The Number of Vertex Labelled Connected Graphs of Order Five with Minimum Five Edges and Maximum Ten Parallel Edges without Loops. In: International Seminar on New Paradigm and Innovation on Natural Scence and Its Application (ISNPINSA) IX, 22 Oktober 2019, FSM Universitas Diponegoro (UNDIP) Semarang. (Submitted)

Amanto and Notiragayu Paper_REV.pdf

Download (337kB) | Preview
Official URL:


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 (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, with minimum five edges and may contain maximum ten parallel edges. Keywords: connected vertex labelled graph, order five, parallel edges.

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: 04 Nov 2019 08:26
Last Modified: 04 Nov 2019 08:26

Actions (login required)

View Item View Item