Science and Technology Indonesia
Vol. 5 No. 4 (2020): October

Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges

Wamiliana Wamiliana (Universitas Lampung)
Amanto Amanto (Universitas Lampung)
Mustofa Usman (Universitas Lampung)
Muslim Ansori (Universitas Lampung)
Fadila Cahya Puri (Universitas Lampung)

Article Info

Publish Date
09 Oct 2020

Abstract

A Graph G (V, E) is said to be a connected graph if for every two vertices on the graph there exist at least a path connecting them, otherwise, the graph is disconnected. Two edges or more that connect the same pair of vertices are called parallel edges, and an edge that starts and ends at the same vertex is called a loop. A graph is called simple if it containing no loops nor parallel edges. Given n vertices and m edges, m ≥ 1, there are many graphs that can be formed, either connected or disconnected. In this research, we will discuss how to calculate the number of connected vertices labeled graphs of order six (isomorphism graphs are counted as one), with a maximum loop of ten without parallel edges.

Copyrights © 2020




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Full PDF
2285.683 KB
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Science and Technology Indonesia
Website

Abbrev

JSTI

Publisher

Universitas Sriwijaya

Subject

Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Environmental Science Materials Science & Nanotechnology Physics

Description

An international Peer-review journal in the field of science and technology published by The Indonesian Science and Technology Society. Science and Technology Indonesia is a member of Crossref with DOI prefix number: 10.26554/sti. Science and Technology Indonesia publishes quarterly (January, April, ...