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

Guardado en:

Detalles Bibliográficos
Autores principales:	Wamiliana, Amanto, Mustofa Usman, Muslim Ansori, Fadila Cahya Puri
Formato:	article
Lenguaje:	EN
Publicado:	Research Center of Inorganic Materials and Coordination Complexes, Universitas Sriwijaya 2020
Materias:	Technology T Science Q
Acceso en línea:	https://doaj.org/article/b253f86d757044a68eab5f15c05d1b97
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:b253f86d757044a68eab5f15c05d1b97
record_format	dspace
spelling	oai:doaj.org-article:b253f86d757044a68eab5f15c05d1b972021-12-02T11:50:20ZEnumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges10.26554/sti.2020.5.4.131-1352580-44052580-4391https://doaj.org/article/b253f86d757044a68eab5f15c05d1b972020-10-01T00:00:00Zhttp://sciencetechindonesia.com/index.php/jsti/article/view/254https://doaj.org/toc/2580-4405https://doaj.org/toc/2580-4391WamilianaAmantoMustofa UsmanMuslim AnsoriFadila Cahya PuriResearch Center of Inorganic Materials and Coordination Complexes, Universitas SriwijayaarticleTechnologyTScienceQENScience and Technology Indonesia, Vol 5, Iss 4, Pp 131-135 (2020)
institution	DOAJ
collection	DOAJ
language	EN
topic	Technology T Science Q
spellingShingle	Technology T Science Q 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
format	article
author	Wamiliana Amanto Mustofa Usman Muslim Ansori Fadila Cahya Puri
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	Research Center of Inorganic Materials and Coordination Complexes, Universitas Sriwijaya
publishDate	2020
url	https://doaj.org/article/b253f86d757044a68eab5f15c05d1b97
work_keys_str_mv	AT wamiliana enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges AT amanto enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges AT mustofausman enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges AT muslimansori enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges AT fadilacahyapuri enumeratingthenumberofconnectedverticeslabeledgraphofordersixwithmaximumtenloopsandcontainingnoparalleledges
_version_	1718395186637176832

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

Ejemplares similares