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

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

Bibliographic Details
Main Authors: Wamiliana, Amanto, Mustofa Usman, Muslim Ansori, Fadila Cahya Puri
Format: Article
Language:English
Published: ARTS Publishing Corp. 2020-10-01
Series:Science and Technology Indonesia
Online Access:http://sciencetechindonesia.com/index.php/jsti/article/view/254
id doaj-b253f86d757044a68eab5f15c05d1b97
record_format Article
spelling doaj-b253f86d757044a68eab5f15c05d1b972020-11-25T02:45:03ZengARTS Publishing Corp.Science and Technology Indonesia2580-44052580-43912020-10-015413113510.26554/sti.2020.5.4.131-135Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel EdgesWamilianaAmantoMustofa UsmanMuslim AnsoriFadila Cahya Purihttp://sciencetechindonesia.com/index.php/jsti/article/view/254
collection DOAJ
language English
format Article
sources DOAJ
author Wamiliana
Amanto
Mustofa Usman
Muslim Ansori
Fadila Cahya Puri
spellingShingle Wamiliana
Amanto
Mustofa Usman
Muslim Ansori
Fadila Cahya Puri
Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
Science and Technology Indonesia
author_facet Wamiliana
Amanto
Mustofa Usman
Muslim Ansori
Fadila Cahya Puri
author_sort Wamiliana
title Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
title_short Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
title_full Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
title_fullStr Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
title_full_unstemmed Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
title_sort enumerating the number of connected vertices labeled graph of order six with maximum ten loops and containing no parallel edges
publisher ARTS Publishing Corp.
series Science and Technology Indonesia
issn 2580-4405
2580-4391
publishDate 2020-10-01
url http://sciencetechindonesia.com/index.php/jsti/article/view/254
work_keys_str_mv AT wamiliana enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges
AT amanto enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges
AT mustofausman enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges
AT muslimansori enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges
AT fadilacahyapuri enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges
_version_ 1724764407661068288

Similar Items