The relationship of the formulas for the number of connected vertices labeled graphs with order five and order six without loops
Abstract
Given a graph with n points and m lines. If each vertex is labeled, then it can be constructed many graphs, connected, or disconnected graphs. A graph G is called a connected graph if there is at least one path that connects a pair of vertices in G. In addition, the graph formed may be simple or not simple. A simple graph is a graph that does not contain loops or parallel lines. A loop is a line that connects a point to itself, and a parallel line is two or more lines that connect the same pair of points. This paper will discuss the relationship between the formula patterns for calculating the number of connected graphs labeled with vertices of order five and six without loops.
Keywords
Full Text:
PDFReferences
Amanto, A., Wamiliana, W., & Efendi, M. F. N. (2018). The number of disconnected vertex labelled graphs of order five with maximum 3-paralel edges is six and contains no loops. Konferensi Nasional Matematika 2018- Unibraw Malang.
Amanto, A., Wamiliana, W., Usman, M., & Permatasari, R. (2017). Counting the number of disconnected vertex labelled graphs with order maximal four. Sci.Int, 29(6), 1181–1186.
Brandes, U., & Cornelsen, S. (2009). Phylogenetic graph models beyond trees. Discrete Applied Mathematics, 157(10). https://doi.org/10.1016/j.dam.2008.06.031
Burch, K. J. (2018). Chemical applications of graph theory. In Mathematical Physics in Theoretical Chemistry. https://doi.org/10.1016/B978-0-12-813651-5.00008-5
Cayley. (1874). On the mathematical theory of isomers. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, 47(314). https://doi.org/10.1080/14786447408641058
Dracjat, I., Wamiliana, W., Asmiati, A., & Amanto, A. (2018). Banyaknya graf terhubung berlabel titik berorde lima dengan garis paralel atau loop maksimal dua serta garis non paralel maksimal enam. Seminar Nasional Metode Kuantitatif II 2018.
Etaiwi, W. M. Al. (2014). Encryption algorithm using graph theory. Journal of Scientific Research and Reports, 3(19). https://doi.org/10.9734/JSRR/2014/11804
Harary, F., & Palmer, E. M. (1973). Graphical enumeration.
Hsu, L.-H., & Lin, C.-K. (2008). Graph theory and interconnection networks. In Graph Theory and Interconnection Networks. https://doi.org/10.1201/9781420044829
Huson, D. H., & Bryant, D. (2006). Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution, 23(2).
Mathur, R., & Adlakha, N. (2016). A graph theoretic model for prediction of reticulation events and phylogenetic networks for DNA sequences. Egyptian Journal of Basic and Applied Sciences, 3(3). https://doi.org/10.1016/j.ejbas.2016.07.004
Puri, F. C., Wamiliana, Usman, M., Amanto, Ansori, M., & Antoni, Y. (2021). The formula to count the number of vertices labeled order six connected graphs with maximum thirty edges without loops. Journal of Physics: Conference Series, 1751(1). https://doi.org/10.1088/1742-6596/1751/1/012023
Putri, D., Wamiliana, Fitriani, Faisol, A., & Dewi, K. S. (2021). Determining the number of disconnected vertices labeled graphs of order six with the maximum number twenty parallel edges and containing no loops. Journal of Physics: Conference Series, 1751(1). https://doi.org/10.1088/1742-6596/1751/1/012024
Wamiliana, Nuryaman, A., Amanto, Sutrisno, A., & Prayoga, N. A. (2019). Determining the number of connected vertices labelled graph of order five with maximum number of parallel edges is five and containing no loops. Journal of Physics: Conference Series, 1338(1). https://doi.org/10.1088/1742-6596/1338/1/012043
Wamiliana, W., Amanto, A., & Tumpi Nagari, G. (2017). Counting the number of disconnected labeled graphs of order five without parallel edges. INSIST, 1(1). https://doi.org/10.23960/ins.v1i1.7
DOI: http://dx.doi.org/10.24042/djm.v4i3.10006
Refbacks
- There are currently no refbacks.
Copyright (c) 2021 Desimal: Jurnal Matematika
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Desimal: Jurnal Matematika is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
