Ansori, Muslim and Wamiliana, Wamiliana and Puri, F. C (2021) 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. Science and Technology Indonesia, 6 (4). pp. 328-336. ISSN e -ISSN:2580-4391 p -ISSN:2580-4405
|
Text
Determining The Number of Connected Vertex Labeled Graphs of Order Seven withoutLoops by Observing The Patterns of Formula for Lower Order Graphs with SimilarProperty.pdf Download (689kB) | Preview |
Abstract
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 or paralel edges. An edge which has the same end vertex is called a loop, and paralel edges are two or more edges which connect the same set of vertices. Let N(G_(7,m,t)) as the number of connected vertex labeled graphs of order seven with m vertices and t (t is the number edges that connect different pair of vertices). The result shows that N(G_(7,m,t)) = c_t C_(t-1)^((m-1)), with c_6=6727, c_7= 30160 , c_8=30765, c_9=21000, c_10=28364, c_11=26880, c_12=26460, c_13=20790, c_14=10290, c_15= 8022, c_16=2940, c_17=4417, c_18=2835, c_19=210, c_20= 21, c_21=1.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA) > Prodi Matematika |
| Depositing User: | WAMILIANA |
| Date Deposited: | 20 Oct 2021 01:41 |
| Last Modified: | 20 Oct 2021 01:41 |
| URI: | http://repository.lppm.unila.ac.id/id/eprint/34566 |
Actions (login required)
 |
View Item |