Counting the number of vertexes labeled connected graphs of order five with minimum five edges and maximum ten parallel edges

If given a graph G(V,E) with n vertices and m edges many graphs can be constructed. The graphs constructed maybe connected graphs (there exists at least one path connecting every pair of vertices in the graph) or disconnected; either simple a (contains loop or parallel edges) or not simple. In, this...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of physics. Conference series 2020-04, Vol.1524 (1), p.12047
Hauptverfasser:	Amanto, Notiragayu, Puri, F C, Antoni, Y, Wamiliana
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Graphs
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!