Zagreb equienergetic bipartite graphs
Künye
Shirdel, G. H. & Ahmadi, S. (2023). Zagreb equienergetic bipartite graphs. TWMS Journal Of Applied And Engineering Mathematics, 13(4), 1586-1593.Özet
Let G be a graph with vertices v1, v2, . . . , vn and let di be the degree of vi. The Zagreb matrix of the graph G is the square matrix of order n whose (i, j)-entry is equal to di + dj if the vertices vi and vj are adjacent, and zero otherwise. The Zagreb energy ZE(G) of G is the sum of the absolute values of the eigenvalues of the Zagreb matrix. Two graphs are said to be Zagreb equienergetic if their Zagreb energies are equal. In this paper, we show how infinitely many pairs of Zagreb equienergetic bipartite graphs can be constructed such that these bipartite graphs are connected, possess an equal number of vertices, an equal number of edges, and are not cospectral.
Cilt
13Sayı
4Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5738http://jaem.isikun.edu.tr/web/index.php/current/122-vol13no4/1139
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ... -
Distance spectra of some graph operations and some new distance equienergetic graphs of diameter 3
Adiga, Chandrashekar; Rakshith, B. R.; Sumithra (Işık University Press, 2019)Two graphs of same order are said to be distance equienergetic if their distance energies are same. In this paper, we first give a partial insight on the distance spectrum of Mycielskian graphs and then we focus on ...