Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Künye
Hemalatha, P. & Gokilamani, S. (2021). Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 178-187.Özet
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 paper, the balanced rank distribution labeling of ladder graphs L-n/2 for even n >= 6, complete graphs K-n for n >= 3 and complete bipartite graphs K-n/2,K-n/2 for even n >= 4 have been investigated and obtained the results on balanced rank distribution number (brd(G)) for the given graphs as follows: (i) brd(L-n/2) = 3n - 15, for even n >= 12 (ii) brd(K-n ) = n, for n >= 3 (iii) brd(K-n/2,K-n/2) = n, for even n >= 4
Cilt
11Sayı
SIBağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/3034http://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/647
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.
-
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 ... -
Graphs cospectral with multicone graphs KW 5 L(P)
Abdian, Ali Zeydi (Işık University Press, 2017)E. R. van Dam and W. H. Haemers [15] conjectured that almost all graphs are determined by their spectra. Nevertheless, the set of graphs which are known to be determined by their spectra is small. Hence, discovering infinite ...