Determining The Number of Connected Vertex Labeled Graphs of Order Seven without Loops by Observing The Patterns of Formula for Lower Order Graphs with Similar Property
Given n vertices and m edges, m ≥ 1, and for every vertex is given a label, there are lots of graphs that can be obtained. The graphs obtained may be simple or not simple, connected or disconnected. A graph G(V,E) is called simple if G(V,E) not containing loops nor paralel edges. An edge which has t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Research Center of Inorganic Materials and Coordination Complexes, FMIPA Universitas Sriwijaya
2021
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |