# On the Pythagorean Holes of Certain Graphs

Source: [On the Pythagorean Holes of Certain Graphs](<https://www.sota2.com/research/paper/68fa52251e209131ce978b32>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T11:44:14.982Z

Authors: Johan Kok, N.K. Sudev, K.P. Chithra

Published: 2015-04-29T03:38:10.000Z

## Abstract

A \\emph{primitive hole} of a graph $G$ is a cycle of length 3 in $G$. The number of primitive holes in a given graph $G$ is called the primitive hole number of the graph $G$. The primitive degree of a vertex $v$ of a given graph $G$ is the number of primitive holes incident on the vertex $v$. 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.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1504.07714>)

[PDF](<https://arxiv.org/pdf/1504.07714.pdf>)
