Ansori, Muslim and Wamiliana, Wamiliana and Fitriani, Fitriani and Antoni, Yudi and Putri, Desiana (2022) Enumerate the Number of Vertices Labeled Connected Graph of Order Seven Containing No Parallel Edges. Science and Technology Indonesia, 7 (3). pp. 392-399. ISSN e -ISSN:2580-4391 p -ISSN:2580-4405
|
Text
Enumerate the Number of Vertices Labeled Connected Graph of Order Seven ContainingNo Parallel Edges.pdf Download (744kB) | Preview |
Abstract
A graph that is connected G(V,E) is a graph in which there is at least one path connecting every two vertices in G; otherwise, it is called a disconnected graph. Labels or values can be assigned to the vertices or edges of a graph. A vertex-labeled graph is one in which only the vertices are labeled, and an edges-labeled graph is one in which only edges are assigned values or labels. If both vertices and edges are labeled, the graph is referred to as total labeling. If given n vertices and m edges, numerous graphs can be made, either connected or disconnected. This study will be discussed the number of disconnected vertices labeled graphs of order seven containing no parallel edges and may contain loops. The results show that number of vertices labeled connected graph of order seven with no parallel edges is N(G7,m, g ºl= 6,727×Cm6; while for 7�g� 21, N(G7,m, g ºl= kg C¹m
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika |
| Depositing User: | FITRIANI FITRIANI |
| Date Deposited: | 26 Sep 2022 01:33 |
| Last Modified: | 26 Sep 2022 01:33 |
| URI: | http://repository.lppm.unila.ac.id/id/eprint/45220 |
Actions (login required)
 |
View Item |