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
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
11Sayı
SIBağlantı
https://hdl.handle.net/11729/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 ... -
On certain topological indices of the derived graphs of subdivision graphs
Hosamani, Sunilkumar M.; Lokesha, Veerebradiah; Cangül, İsmail Naci; Devendraiah, K. M. (Işık University Press, 2016-03-11)The derived graph [G]† of a graph G is the graph having the same vertex set as G, with two vertices of [G]† being adjacent if and only if their distance in G is two. Topological indices are valuable in the study of QSAR/QSPR. ... -
Degree equivalence graph of a graph
Rajendra, R.; Siva Kota Reddy, Polaepalli; Madhusudhan, Krishnarajapete Venkatarama (Işık University Press, 2020)Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex set S. Given a graph with vertex set V , we can define an equivalence relation on V using the concept of degree of a vertex ...