Graph Theory has many applications in dailylife. One of the topics discussed in graph theory is the number of spanning trees of a graph. In graph theory, a tree is aconnected graph that has no cycle. The number of spanning trees of a connected graph is defined as the number of trees that can be constructed from the graph which passing through all its vertices. In this paper, spanning trees from a barbell graph will be discussed. A Barbell Graph (,) is a graph obtained by connecting-copies of a complete graph by a bridge. In this article it is found that the number of spanning trees of barbell graph , is equal to −2. Some characteristic of spanning trees and barbell graph also will be discussed in this paper.
The notion of the prime graph of a ring R was first introduced by Bhavanari, Kuncham, and Dasari in 2010. The prime graph of a ring R, denoted by PG(R) is a graph whose vertices are all elements of the ring, where two distinct vertices x and y are adjacent if and only if xRy = 0 or yRx = 0. In this paper, we study the forms and properties of the prime graph of integer modulo group, and some examples of the number of its spanning trees. In this paper, it is found that for all n, the maximum degree of vertices of PG(Z_n) is n-1 and the minimum degree of its vertices is 1. Then, we show that for all n, PG(Z_n) is neither a Hamiltonian graph nor an Eulerian graph. We also found some examples of the number of its spanning trees.Keywords: prime graph; spanning trees; Hamiltonian graph. AbstrakKonsep mengenai graf prima dari suatu gelanggang R pertama kali diperkenalkan oleh Bhavanari, Kuncham, dan Dasari pada tahun 2010. Graf prima dari suatu gelanggang R, yang dinotasikan dengan PG(R), adalah suatu graf yang simpul-simpulnya merupakan semua elemen dari gelanggang tersebut dengan dua buah simpul x dan y yang berbeda akan bertetangga jika dan hanya jika xRy = 0 atau yRx = 0. Di dalam penelitian ini, dikaji mengenai bentuk-bentuk dan sifat-sifat dari PG(Z_n), dan beberapa contoh dari banyak pohon pembangunnya. Pada penelitian ini, ditemukan hasil bahwa untuk setiap n, derajat maksimal dari simpul-simpul di PG(Z_n) adalah n-1 dan derajat minimum dari simpul-simpulnya adalah 1. Hasil selanjutnya yaitu, untuk setiap n, PG(Z_n) bukan merupakan suatu graf Hamiltonian atau graf Eulerian. Ditemukan juga beberapa contoh dari banyaknya pohon pembangun dari PG(Z_n).Kata Kunci: graf prima; pohon pembangun; graf Hamiltonian. 2020MSC: 05E16, 05C90, 20C05
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.