Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal INSIST (International Series on Interdisciplinary Research)
Grita Tumpi Nagari
Unknown Affiliation
Other

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Counting the Number of Disconnected Labeled Graphs of Order Five without Paralel Edges Wamiliana Wamiliana; Amanto Amanto; Grita Tumpi Nagari
INSIST Vol 1, No 1 (2016)
Publisher : Universitas Lampung

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (308.589 KB) | DOI: 10.23960/ins.v1i1.7

Abstract

Abstract— 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  and  can be obtained with the following formula: {{.    is the number of disconnected labeled graph without parallel edges for  and . Keywords—  counting graph, labeled graph, disconnected, parallel edges
Co-Authors . Wamiliana Amanto Amanto