Laceability properties in edge tolerant corona product graphs
Künye
Gomathi, P. & Murali, R. (2020). Laceability properties in edge tolerant corona product graphs. TWMS Journal Of Applied And Engineering Mathematics, 10(3), 734-740.Özet
A connected graph G is termed Hamiltonian-t-laceable if there exists in it a Hamiltonian path between every pair of vertices u and v with the property d(u, v) = t, 1 ≤ t ≤ diam(G), where t is a positive integer. The corona product of G and H, denoted by GoH is obtained by taking one copy of G called the center graph, |V (G)| copies of H called the outer graph and taking the ith vertex of G adjacent to every vertex of the ith copy of H where 1 ≤ i ≤ |V (G)|. In this paper, we establish laceability properties in the edge tolerant corona product graph KnoPm.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
10Sayı
3Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2859http://jaem.isikun.edu.tr/web/index.php/archive/106-vol10no3/566
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 ...