Wamiliana, Wamiliana and Nuryaman, Aang and Amanto, Amanto and Sutrisno, Agus and Prayoga, Nandra (2019) Determining the Number of Connected Vertices Labelled Graph of Order Five with Maximum Number of Parallel Edges is Five and Containing No Loops. Journal of Physics : Conference series : IOP Conf. Series: Journal of Physics: Conf. Series 1338 (2019) 012043 doi:10.1088/1742-6596/1338/1/012043, 1338 (012043). pp. 1-6.

[img] Text
Wamiliana_2019_J._Phys.__Conf._Ser._1338_012043.pdf

Download (868kB)

Abstract

Abstract. A connected graph is a graph where there exists at least a path joining every pair of the vertices in the graph, and a graph is called simple if that graph containing no loops nor parallel edges. Given a graph G (V, E) with n vertices and m edges, there are a lot of graph that can be formed, either connected or disconnected, or simple or not simple. In this paper we will discuss the number of connected vertex labelled graph of order five (n=5) and 4 ≤ m ≤ 10, with maximum number of parallel edges that connecting different pairs of vertices is five (the parallel edges that connecting the same pair of vertices are counted as one).

Item Type: Article
Subjects: Q Science > QA Mathematics
Divisions: Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika
Depositing User: WAMILIANA
Date Deposited: 05 Nov 2019 10:49
Last Modified: 05 Nov 2019 10:49
URI: http://repository.lppm.unila.ac.id/id/eprint/15381

Actions (login required)

View Item View Item