Enumerating the Number of Connected Vertices Labeled Graph of Order Six with Maximum Ten Loops and Containing No Parallel Edges
Saved in:
Main Authors: | Wamiliana, Amanto, Mustofa Usman, Muslim Ansori, Fadila Cahya Puri |
---|---|
Format: | article |
Language: | EN |
Published: |
Research Center of Inorganic Materials and Coordination Complexes, Universitas Sriwijaya
2020
|
Subjects: | |
Online Access: | https://doaj.org/article/b253f86d757044a68eab5f15c05d1b97 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
by: Luis Gouveia, et al.
Published: (2015) -
Bicyclic Graphs with the Second-Maximum and Third-Maximum Degree Resistance Distance
by: Wenjie Ning, et al.
Published: (2021) -
The edge-to-edge geodetic domination number of a graph
by: John,J., et al.
Published: (2021) -
Comment on "Edge Geodetic Covers in Graphs
by: Santhakumaran,A. P., et al.
Published: (2015) -
El empadronamiento = The enumeration
Published: (2014)