Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
Guardado en:
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: | |
Acceso en línea: | https://doaj.org/article/b253f86d757044a68eab5f15c05d1b97 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
por: Luis Gouveia, et al.
Publicado: (2015) -
Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance
por: Wenjie Ning, et al.
Publicado: (2021) -
The edge-to-edge geodetic domination number of a graph
por: John,J., et al.
Publicado: (2021) -
Comment on "Edge Geodetic Covers in Graphs
por: Santhakumaran,A. P., et al.
Publicado: (2015) -
El empadronamiento = The enumeration
Publicado: (2014)