Putri, Desiana and Wamiliana, Wamiliana and Fitriani, Fitriani and Faisol, Ahmad and Dewi, K. S (2021) Determining the Number of Disconnected Vertices Labeled Graphs of Order Six with the Maximum Number Twenty Parallel Edges and Containing No Loops. IOP Conference Series: Materials Science and Engineering, 1751 (12024). pp. 17. ISSN 1757899X

Text
Putri_2021_J._Phys.__Conf._Ser._1751_012024.pdf Download (587kB)  Preview 
Abstract
If there exist two vertices on a given graph that are not connected by a path, then we call that graph is disconnected. Given a graph with n vertices and m edges, then a lot of graphs can be constructed. In this paper, we discuss the number of disconnected vertices labeled graphs of order six (n = 6) with the maximum number of parallel edges is twenty. Moreover, a maximum number of edges that connect different pair of vertices is ten (parallel edges are counted as one) and containing no loops (isomorphic graphs 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:  23 Feb 2021 02:12 
Last Modified:  23 Feb 2021 02:12 
URI:  http://repository.lppm.unila.ac.id/id/eprint/28035 
Actions (login required)
View Item 