Searcharxiv⌕ Search

arXiv subjects

John Rafael M. Antalan

Publications and source records attributed to John Rafael M. Antalan.

7 recordsLinked to original sources
arXiv2025

Edge-graceful usual fan graphs

A graph $G$ with $p$ vertices and $q$ edges is said to be edge-graceful if its edges can be labeled from $1$ through $q$, in such a way that the labels induced on the vertices by adding over the labels of incident edges modulo $p$ are distinct. A known result under this topic is Lo's Theorem, which states that if a graph $G$ with $p$ vertices and $q$ edges is edge-graceful, then $p\Big|\Big(q^{2}+q-\dfrac{p(p-1)}{2}\Big)$. This paper presents novel results on the edge-gracefulness of the usual fan graphs. Using Lo's Theorem, the concepts of divisibility and Diophantine equations, and a computer program created, we determine all edge-graceful usual fan graphs $F_{1,n}$ with their corresponding edge-graceful labels.

math.CO↗
arXiv2021

On $k$-dprime Divisor Function Graph

Let $p$ and $q$ be distinct primes. The \textit{semiprime divisor function graph} denoted by $G_{D(pq)}$, is the graph with vertex set $V(G_{D(pq)})=\{1,p,q,pq\}$ and edge set $E(G_{D(pq)})=\{\{1,p\}, \{1,q\},\{1,pq\},\{p,pq\},\{q,pq\}\}$. The semiprime divisor function graph is a special type of divisor function graph $G_{D(n)}$ in which $n=pq$. Recently, the energy and some indices of semiprime divisor function graph have been determined. In this paper, we introduce a natural extension to the semiprime divisor function graph which we call the \textit{$k$-dprime divisor function graph}. Moreover, we present results on some distance-based and degree-based topological indices of $k$-dprime divisor function graph. We end the paper by giving some open problems.

math.CO↗
arXiv2020

Distance Eigenvalues and Forwarding Indices of Multiplicative Circulant Graph of Order Power of Two and Three

In this paper, we use Breadth-first search algorithm to determine the distance matrix of multiplicative circulant graph of order power of two and three. As a consequence, the diameter of the graphs were determined. We also give their distance spectral radii, average distances, as well as the exact values of vertex-forwarding indices. Finally, using some known relationships between the distance spectral radii and forwarding indices of a graph, we give some bounds for their edge-forwarding indices.

math.CO↗
arXiv2020

A Recreational Application of Two Integer Sequences and the Generalized Repetitious Number Puzzle

In this article, we give a particular recreational application of the sequence A000533 and A261544 in "The On-line Encyclopedia of Integer Sequences" (OEIS). The recreational application provides a direct extension to "The Repetitious Number" puzzle of Martin Gardner contained in The Second Scientific American Book of Mathematical Puzzles and Diversions published in 1961. We then provide a generalization to the repetitious number puzzle and give a related puzzle as an illustrative example. Finally, as a consequence of the generalization, we define a family of sequence in which the sequences A000533 and A261544 belong.

math.HO↗
arXiv2015

A Note on Generating Almost Pythagorean Triples

In 1987, Orrin Frink introduced the concept of almost Pythagorean triples. He defined them as an ordered triple $(x,y,z)$ that satisfies the equation $x^2+y^2=z^2+1$ where $x,y$ and $z$ are positive integers. In his paper, he showed that there were infinitely many almost Pythagorean triples by giving a characterization which suggests a method on generating all of them. However, this method does not explicitly and readily give a particular almost Pythagorean triple. In this note, using basic algebraic operations, we extend his result by giving a characterization that explicitly and readily give a particular almost Pythagorean triple.

math.NT↗
arXiv2015

Numeric Palindromes in Primitive and Non-primitive Pythagorean Triples

In this article we consider numeric palindromes as a component of a pythagorean triple. We first show that there are infinitely many non-primitive pythagorean triples that contains (i) a single numeric palindrome as a component, (ii) two numeric palindromes as a component and (iii) three numeric palindromes as a component. We then focus on numeric palindromes in primitive pythagorean triples. Open problem related to the topic was also given.

math.NT↗