Open AccessThe Formula to Count The Number of Vertices Labeled Order Six Connected Graphs with Maximum Thirty Edges without Loops
Author(s) -
Fadila Cahya Puri,
Wamiliana,
Mustofa Usman,
Amanto,
Muslim Ansori,
Y Antoni
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1751/1/012023
Subject(s) - combinatorics , path graph , mathematics , multiple edges , edge graceful labeling , vertex (graph theory) , discrete mathematics , wheel graph , graph , graph power , line graph
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.