Wamiliana, Wamiliana and Amanto, Amanto and Nagari, Grita Tumpi (2016) Counting The Number of Disconnected Labeled Graphs of Order Five without Paralel Edges. Internasional Series on Interdisciplinary Research, 1 (1). pp. 4-7. ISSN 978-602-70050-3-7

Counting the number of disconnected labelled graphs.pdf

Download (306kB) | Preview
Official URL: http://insist.unila.ac.id/index.php/ojs/index


Given a graph G(V,E) with n vertices and m edges, where every vertex is labeled, there are a lot of possible graphs that can be constructed, either connected graphs or disconnected, simple or not simple. A graph G(V,E) is called as a connected graph if there exists at least one path between every pair of vertices in G, and otherwise, G is disconnected. A graph G is called as a labeled graph if every node/vertex and or every edge is labeled. In this research, we are concerning about a graph where every vertex is labeled. Parallel edges are two edges or more which have the same end points. In this research we found that the number of disconnected labeled graph without parallel edges for n=5 and m"≥1" can be obtained with the following formula: N(〖G^'〗_(5,m) )=((m+4)¦4)+{10×((m+3)¦4) }+{45×((m+2)¦4) }+{120×((m+1)¦4)}+{85×(m¦4)}+{30×((m-1)¦4)}+{5×((m-2)¦4)}. N(〖G^'〗_(5,m) ) is the number of disconnected labeled graph without parallel edges for n=5 and m≥1. Keywords— counting graph, labeled graph, disconnected, 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: 26 May 2017 07:29
Last Modified: 26 May 2017 07:29
URI: http://repository.lppm.unila.ac.id/id/eprint/1633

Actions (login required)

View Item View Item