Pathos degree prime graph of a tree
Künye
Nagesh, H. M. (2023). Pathos degree prime graph of a tree. TWMS Journal Of Applied And Engineering Mathematics, 13(1), 53-64.Özet
Let T be a tree of order n (n ≥ 2). A pathos degree prime graph of T, written PDP(T), is a graph whose vertices are the vertices and paths of a pathos of T, with two vertices of PDP(T) adjacent whenever the degree of the corresponding vertices of T are unequal and relatively prime; or the corresponding paths Pʹᵢ and Pʹᵢ (i ≠ j) of a pathos of T have a vertex in common; or one corresponds to the path Pʹ and the other to a vertex v and Pʹ begins (or ends) at v such that v is a pendant vertex in T. We look at some properties of this graph operator. For this class of graphs we discuss the planarity; outerplanarity; maximal outerplanarity; minimally nonouterplanarity; Eulerian; and Hamiltonian properties these graphs.
Kaynak
TWMS Journal Of Applied And Engineering MathematicsCilt
13Sayı
1Bağlantı
https://hdl.handle.net/11729/5201http://jaem.isikun.edu.tr/web/index.php/current/118-vol13no1/943
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir: