Even vertex odd mean labeling of transformed trees
Künye
Jeyanthi, P., Ramya, D. & Selvi, M. (2020). Even vertex odd mean labeling of transformed trees. TWMS Journal of Applied and Engineering Mathematics, 10(2), 338-345.Özet
Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean labeling if there exists a function f: V (G) →{0; 2; 4;:::; 2q} satisfying f is 1-1 and the induced map f*: E(G) → {1; 3; 5;:::; 2q-1g} defined by f*(uv) = f(u)+f(v)/2 is a bijection. A graph that admits even vertex odd mean labeling is called an even vertex odd mean graph. In this paper, we prove that Tp-tree (transformed tree), T@P���, T@2Pn and <T OK₁, n> (where T is a Tp-tree), are even vertex odd mean graphs.
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
10Sayı
2Bağlantı
https://hdl.handle.net/11729/2820http://jaem.isikun.edu.tr/web/index.php/archive/105-vol10no2/523
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.
-
New results on odd harmonious labeling of graphs
Jeyanthi, Pon; Philo, Simon (Işık University Press, 2022)Let G = (V, E) be a graph with p vertices and q edges. A graph G is said to be odd harmonious if there exists an injection f : V (G) ? {0, 1, 2, · · · , 2q ? 1}such that the induced function f* : E(G) ? {1, 3, · · · , 2q ... -
Derin öznitelikler ile anlambilimsel görüntü bölütleme
Sünetci, Sercan; Ateş, Hasan Fehmi (Institute of Electrical and Electronics Engineers Inc., 2018-07-05)Derin evrişimsel sinir ağları (ESA) pek çok sınıflandırma probleminde olduğu gibi anlambilimsel görüntü bölütlemede de çok ciddi başarı göstermiştir. Fakat derin ağların eğitilmesi hem zaman alıcıdır hem de geniş bir eğitim ... -
Highly total prime labeling for some duplicate graph
Kavitha, Panneer Selvam (Işık University Press, 2022)Let G = (V, E) be a graph with p vertices and q edges. A bijection f : V ?E ? {1, 2, · · · , p+q} is said to be a highly total prime labeling if (i) for each edge e = uv, the labels assigned to u and v are relatively prime ...