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ı
https://hdl.handle.net/11729/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 ... -
Disjunctive total domination in some graphs derived from the subdivision graph
Çiftçi, Canan; Aytaç, Aysun (Işık University Press, 2021)For a set S ⊆ V (G), if every vertex has a neighbor in S or has at least two vertices in S at distance two from it, then the set S is a disjunctive total dominating set of G. The minimum cardinality of such a set is equal ... -
Middle graph of semiring valued graphs
Tamilselvi, A.; Ponni, M. (Işık University Press, 2023-04)In this paper, we define middle graph of semiring valued graph M(G^S) and study the regularity of M(G^S) where G^S is the semiring valued graph (or simply Svalued graph).