Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
Enregistré dans:
Auteurs principaux: | Wamiliana, Amanto, Mustofa Usman, Muslim Ansori, Fadila Cahya Puri |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Research Center of Inorganic Materials and Coordination Complexes, Universitas Sriwijaya
2020
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/b253f86d757044a68eab5f15c05d1b97 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
par: Luis Gouveia, et autres
Publié: (2015) -
Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance
par: Wenjie Ning, et autres
Publié: (2021) -
The edge-to-edge geodetic domination number of a graph
par: John,J., et autres
Publié: (2021) -
Comment on "Edge Geodetic Covers in Graphs
par: Santhakumaran,A. P., et autres
Publié: (2015) -
El empadronamiento = The enumeration
Publié: (2014)