Amanto, Amanto and Wamiliana, Wamiliana and Usman, Mustofa and Permatasari, Reni (2017) COUNTING THE NUMBER OF DISCONNECTED VERTEX LABELLED GRAPHS WITH ORDER MAXIMAL FOUR. Science International Lahore, 29 (6). pp. 11811186. ISSN 10135316

Text
Paper Amanto Sciint.pdf Download (805kB)  Preview 
Abstract
An undirected graph G(V,E) with n vertices and m edges is called to be connected if every pair of the vertices in G exists a path connecting them, otherwise, G is disconnected. A graph can be labeled if only the vertices are labelled and it is called vertex labelling, if only edges are labelled then it is called as edge labelling, and if both vertices and edges are labelled, it is called as total labelling. The edge that has the same starting and end point is called a loop, and two or more edges that connect the same vertices are called parallel edges. A graph is called simple if there is neither loop nor parallel edge on that graph. Given n vertices and m edges there are a lot of possible graphs can be constructed either connected or not, simple or not. In this research we discuss about counting the number of disconnected vertex labelled graph for graph with order maximal four and m ≥ 1. Keywords : counting graph, vertex labelled graph, disconnected, graph order
Item Type:  Article 

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