LACEABILITY PROPERTIES IN THE IMAGE GRAPH OF PRISM GRAPHS

LACEABILITY PROPERTIES IN THE IMAGE GRAPH OF PRISM GRAPHS

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 [less than or equal to] t [less than or equal to] diam(G), where t is a positive integer. In this paper, we establish laceability prop...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TWMS journal of applied and engineering mathematics 2023-01, Vol.13 (4), p.1396
Hauptverfasser: Gomathi, P, Murali, R
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Graph theory
Graphs
Mathematical research
Mathematics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 [less than or equal to] t [less than or equal to] diam(G), where t is a positive integer. In this paper, we establish laceability properties in the image graph of Prism graph Im([Y.sub.n]). Keywords: Hamiltonian graph, Hamiltonian laceable graph, Hamiltonian-t-laceable graph, Prism graph, Image graph. AMS Subject Classification: [2010] 05C45, 05C99.
ISSN:2146-1147
2146-1147