The Formula to Count The Number of Vertices Labeled Order Six Connected Graphs with Maximum Thirty Edges without Loops

If for every pair of vertices in a graph G(V,E) there exist minimum one path joining them, then G is called connected, otherwise the graph is called disconnected. If n vertices and m edges are given then numerous graphs are able to be created. The graphs created might be disconnected or connected, a...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-01, Vol.1751 (1), p.12023
Main Authors: Puri, F C, Wamiliana, Usman, M, Amanto, Ansori, M, Antoni, Y
Format: Article
Language:English
Subjects:
Apexes
connected graph
Graph theory
Graphs
loopless
order six
parallel edges
Physics
vertices labeled
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:If for every pair of vertices in a graph G(V,E) there exist minimum one path joining them, then G is called connected, otherwise the graph is called disconnected. If n vertices and m edges are given then numerous graphs are able to be created. The graphs created might be disconnected or connected, and also maybe simple or not. A simple graph is a graph whose no paralled edges nor loops. A loop is an edges that connects the same vertex while paralled edges are edges that connecting the same pair of vertices. In this research we will discuss the formula to count the number of connected vertex labeled order six graph containing at most thirty edges and may contain fifteen parallel edges without loops.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1751/1/012023