The Complexity of Pencil Graph and Line Pencil Graph
Calvin Hanssen, Fransiskus Fran, Yundari Yundari Β· PYTHAGORAS Jurnal Pendidikan Matematika Β· 2024
Let π’ be a linked and undirected graph. Every linked graph π’ must contain a spanning tree π―, which is a subgraph of π’that is a tree and contain all the nodes of π’. The number of spanning trees in graph π’, also called the complexity of the graph π’, represented by Ο(π’), is the total number of distinct spanning trees of graph π’. This research aims to formulate the complexity of pencil graph and line pencil graph. In this research, the complexity of pencil graph and line pencil graph are determined using graph complement approach. The result of the research are the complexity of pencil graph and line pencil graph.