IJPAM: Volume 107, No. 1 (2016)




City of Tshwane, SOUTH AFRICA

Vidya Academy of Science & Technology
Thrissur, INDIA

Thrissur, 680301, INDIA
Abstract. A primitive hole of a graph is a cycle of length
in
. The number of primitive holes in a given graph
is called the primitive hole number of that graph
. The primitive degree of a vertex
of a given graph
is the number of primitive holes incident on the vertex
. In this paper, we introduce the notion of Pythagorean holes of graphs and initiate some interesting results on Pythagorean holes in general as well as results in respect of set-graphs and Jaco graphs.
Received: February 12, 2016
AMS Subject Classification: 05C07, 05C20, 05C38
Key Words and Phrases: set-graphs, Jaco graphs, primitive hole, Pythagorean hole, graphical embodiment of a Pythagorean triple
Download paper from here.
DOI: 10.12732/ijpam.v107i1.15 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2016
Volume: 107
Issue: 1
Pages: 187 - 200
Google Scholar; DOI (International DOI Foundation); WorldCAT.
This work is licensed under the Creative Commons Attribution International License (CC BY).