Calculating the Number of vertices Labeled Order Six Disconnected Graphs which Contain Maximum Seven Loops and Even Number of Non-loop Edges Without Parallel Edges

A labeled graph is a graph where each vertex or edge is given a value or label. A line/edge with the same starting and ending vertex is called a loop. If given n vertices and m edges, then there are lot disconnected vertices labeled graphs that can be formed. Among those graphs, there are graphs wit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of physics. Conference series 2021-01, Vol.1751 (1), p.12026
Hauptverfasser:	Pertiwi, F A, Amanto, Wamiliana, Asmiati, Notiragayu
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes disconnected graphs Graph theory Graphs loops order six parallel edges Physics vertices labeled
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!