Pertiwi, F A and Amanto, Amanto and Wamiliana, Wamiliana and Asmiati, Asmiati and Notiragayu, Notiragayu (2021) Calculating the Number of vertices Labeled Order Six Disconnected Graphs which Contain Maximum Seven Loops and Even Number of Non-loop Edges Without Parallel Edges. IOP Conference Series: Materials Science and Engineering, 1751 (12026). pp. 1-8. ISSN 1757-899X

Preview

Text Pertiwi_2021_J._Phys.__Conf._Ser._1751_012026.pdf Download (602kB) | Preview

Abstract

A labeled graph is a graph where each vertex or edge is given a value or label. A line/edge with the same starting and ending vertex is called a loop. If given n vertices and m edges, then there are lot disconnected vertices labeled graphs that can be formed. Among those graphs, there are graphs with maximum seven loops and whose non-loop edges are even. In this research, we will discuss the formula for finding that kinds of graphs.

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/28033

Actions (login required)

View Item