Some new results on integer additive set-valued signed graphs
Künye
Sudev, N. K., Ashraf, P. K. & Germina, K. A. (2019). Some new results on integer additive set-valued signed graphs. TWMS Journal Of Applied And Engineering Mathematics, 9(3), 638-645.Özet
Let X denotes a set of non-negative integers and P(X) be its power set. An integer additive set-labeling (IASL) of a graph G is an injective set-valued function f : V (G) ? P(X) ? {?} such that the induced function f+ : E(G) ? P(X) ? {?} is defined by f+(uv) = f(u) + f(v); ? uv ? E(G), where f(u) + f(v) is the sumset of f(u) and f(v). An IASL of a signed graph is an IASL of its underlying graph G together with the signature ? defined by ?(uv) = (?1)|f+(uv)|; ? uv ? E(?). In this paper, we discuss certain characteristics of the signed graphs which admits certain types of integer additive set-labelings.
Cilt
9Sayı
3Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2752http://jaem.isikun.edu.tr/web/index.php/archive/102-vol9no3/447
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 ...