Open AccessDetermining the Number of Disconnected Vertices Labeled Graphs of Order Six with the Maximum Number Twenty Parallel Edges and Containing No Loops
Author(s) -
Desi Febriani Putri,
Wamiliana,
Fitriani Fitriani,
Ahmad Faisol,
Karina Sylfia Dewi
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/012024
Subject(s) - combinatorics , path graph , mathematics , multiple edges , wheel graph , graph , discrete mathematics , 1 planar graph , graph power , chordal graph , line graph
If there exist two vertices on a given graph that are not connected by a path, then we call that graph is disconnected. Given a graph with n vertices and m edges, then a lot of graphs can be constructed. In this paper, we discuss the number of disconnected vertices labeled graphs of order six ( n = 6) with the maximum number of parallel edges is twenty. Moreover, a maximum number of edges that connect different pair of vertices is ten (parallel edges are counted as one) and containing no loops (isomorphic graphs are counted as one).