PATHOS DEGREE PRIME GRAPH OF A TREE

Let T be a tree of order n (n [greater than or equal to] 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 relativel...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 13; no. 1; p. 53
Main Author Nagesh, H. M
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.01.2023
Elman Hasanoglu
Subjects
Apexes
Graph theory
Graphs
Mathematical research
India
Online AccessGet full text
ISSN2146-1147
2146-1147

Cover

More Information
Summary:Let T be a tree of order n (n [greater than or equal to] 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'.sub.i] and [P'.sub.j] (i [not equal to] 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. Keywords: Crossing number, inner vertex number, pathos, path number. AMS Subject Classification: 05C05, 05C45.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2146-1147
2146-1147