betaFeedback

WorksMathematics

Short Paper No. 1: Relation between integer sequence A319433 and the maximum degrees of finite linear Jaco graphs

Abstract

This short paper presents the interesting relation between integer sequence A319433 in https://oeis.org and the maximum degrees of the family of finite linear Jaco graphs Jn(x)J_n(x) where n=1,2,3,…n = 1,2,3,\dots. The result first appeared as a conjecture. Subsequently, a proof through AI-assisted mathematical reasoning came to the fore. Appropriate clarity remarks follow in the main text. It appears that Golden ratio\textit{Golden ratio}-like floor function plays an important role in the analysis of the graph structural properties of the family of finite linear Jaco graphs.

Preliminary remarks

Numerous conjectures appeared in [3]. Subsequently the first author tested the ability of AI-assisted mathematical reasoning technology (under development) to present valid proofs of the conjectures. The second author evaluated the proofs for correctness. Both authors co-authored this manuscript. See § 6.

Most of introduction replicates much which is found in [3]. The reason is twofold. Firstly, it makes this short paper self-contained and secondly, the arXived manuscript has not officially been published in any journal. This first, in a series of short papers is formally submitted to undergo rigorous peer review as well.

Introduction

It is assumed that the reader is familiar with the basic terminology and notions of graph theory. See [1, 2, 10]. When the context is clear, notation such as deg⁡G(v)\operatorname{deg}_G(v) will be abbreviated to deg⁡(v)\operatorname{deg}(v) and so on. In 2014 the authors Kok et al. introduced the family of directed finite linear Jaco graphs. See [4, 5] and the references thereto. Unless stated otherwise, all graphs in this short paper will be the underlying graph of the directed finite linear Jaco graphs (for reference, linear Jaco graphs).

The motivation for the study in [3] does not lie in possible applications of linear Jaco graphs per se but rather in a new research avenue i.e. relations between some integer sequences and certain parameters of linear Jaco graphs. In addition to the aforesaid the validation of AI-assisted mathematical reasoning to prove of such conjectured relations has come to the fore. Clearly, the aforesaid has real world applications. Recall that a sequence of non-negative integers, say

d=(d1,d2,d3,…,dn)\mathbf{d} = (d_1,d_2,d_3,\ldots,d_n)

is said to be graphical if there exists a simple graph GG which has degree sequence d\mathbf{d}. Put differently, d\mathbf{d} is graphical in respect of the vertex degrees if there exists a simple graph GG which has degree sequence d\mathbf{d}. Note that d\mathbf{d} could be either a random or a definable sequence. A definable sequence can only be generated from a closed or recursive formula. A generalization can be investigated. That is, if p(G)p(G) is a graph parameter (independence number, domination number, chromatic number, hub number and so on) then a definable sequence (finite or infinite) p=p1,p2,p3,…,pn\mathbf{p}=p_1,p_2,p_3,\ldots,p_n is pp-graphical if a family (or set) or subset of a family of simple graphs exists, say F={G1,G2,G3,…,Gn}\mathcal{F}=\{G_1,G_2,G_3,\ldots,G_n\} such that,

p(G1)=p1, p(G2)=p2, p(G3)=p3, …, p(Gn)=pn.p(G_1)=p_1,\ p(G_2)=p_2,\ p(G_3)=p_3,\ \ldots,\ p(G_n)=p_n.

Note that the notion of a pp-graphical sequence extends over graph parameters (global as mentioned above) and parameters related to graph elements (local), for example the eccentricity of a vertex, e(v)e(v), the degree of a vertex, deg⁡G(v)\operatorname{deg}_G(v), the distance between two distinct edges and so on. For the aforesaid the notation is p(G,v)p(G,v) or p(G,e)p(G,e). The parameter may also be a hybrid such as vertex-edge domination and edge-vertex domination (see [8]) or it may concern subsets of V(G)V(G) or E(G)E(G) and so on. The corresponding notation will be p(G,(v,e))p(G,(v,e)) or p(G,(e,v))p(G,(e,v)) or p(G,S)p(G,S) where S⊆V(G)S\subseteq V(G) or S⊆E(G)S\subseteq E(G).

Example: The infinite integer sequence p=1,2,3,…\mathbf{p}=1,2,3,\ldots is pp-graphical for p=χ(G)p=\chi(G) (chromatic number of graph) since F={K1,K2,K3,…}\mathcal{F}=\{K_1,K_2,K_3,\ldots\} exists and

χ(K1)=1, χ(K2)=2, χ(K3)=3,…\chi(K_1)=1,\ \chi(K_2)=2,\ \chi(K_3)=3,\ldots

Note 2.1. The notion of graphical degree sequences is generalized to graphical graph parametric sequences. This avenue for further research remains open.

On linear Jaco graphs

Readers are referred to [4, 5] for the formal definitions of J∞(x)J_{\infty}(x) and Jn(x)J_n(x). Since our interest lies with the underlying graph we recall the construction method as explained in [6] with some additional refinement.

Construction method to obtain Jn(x)J_n(x), n≥4n \ge4:

(a) Let J1(x)=P1J_1(x)=P_1, J2(x)=P2J_2(x)=P_2 and J3(x)=P3J_3(x)=P_3.

(b) Let the empty graph (edgeless graph) of order m≥1m \ge1 be denoted by Nm\mathbb{N}_m. Let X={vi:i=4,5,6,…,n}X=\{v_i:i=4,5,6,\ldots,n\} and let G2=P3∪Nn−3G_2=P_3\cup\mathbb{N}_{n-3} where V(Nn−3)=XV(\mathbb{N}_{n-3})=X.

(c) By normal consecutive step-count for i=3,4,5,…,n−1i=3,4,5,\ldots,n-1 do as follows:

To obtain GiG_i add the edges vivi+1,vivi+2,…,vivi+tv_iv_{i+1},v_iv_{i+2},\ldots,v_iv_{i+t} with tt a maximum such that, deg⁡Gi(vi)≤i\deg_{G_i}(v_i)\le i.

(d) After completion of step-count i=n−1i=n-1 label the resultant graph Jn(x)J_n(x). Note that Jn(x)J_n(x) is a simple connected undirected graph.

Recall from [6] that for a given Jn(x)J_n(x) the open neighborhood of viv_i in a given by: N(vi)=N−(vi)∪N+(vi)N(v_i)=N^{-}(v_i)\cup N^{+}(v_i) where N−(vi)={vj:j<i and the edge vjvi exists}N^{-}(v_i)=\{v_j:j<i\text{ and the edge }v_jv_i\text{ exists}\} and N+(vi)={vj:j>i and the edge vivj exists}N^{+}(v_i)=\{v_j:j>i\text{ and the edge }v_iv_j\text{ exists}\}. Also let t1(vi)=∣N−(vi)∣t_1(v_i)=|N^{-}(v_i)| and t2(vi)=∣N+(vi)∣t_2(v_i)=|N^{+}(v_i)| and let t2∗(vi)=max⁡{t2(vi) in Jn(x) evaluated at vi:n≥i}t_2^*(v_i)=\max\{t_2(v_i)\text{ in }J_n(x)\text{ evaluated at }v_i:n\ge i\}. The aforesaid yields t2∗(vi)=i−t1(vi)t_2^*(v_i)=i-t_1(v_i).

All sequences mentioned in this paper are found in [9]. Recall that Wagner [4, 6] identified that in accordance with sequence A060144 the result t1(vi)=⌊2(i+1)3+5⌋t_1(v_i)=\left\lfloor\frac{2(i+1)}{3+\sqrt{5}}\right\rfloor, i=1,2,3,…i=1,2,3,\ldots holds. Put differently, the sequence A060144 is pp-graphical where p(G)=t1(vi)p(G)=t_1(v_i), i=1,2,3,…i=1,2,3,\ldots and F={G:G=Jn(x),n=1,2,3,…}\mathcal{F}=\{G:G=J_n(x),n=1,2,3,\ldots\} or simply J∞(x)J_{\infty}(x).

Maximum degree of Jn(x)J_n(x), n=1,2,3,…n=1,2,3,\ldots

In [3] it is conjectured (see Conjecture 2.2 in [3]) that for the finite linear Jaco graphs Jn(x)J_n(x), n=2,3,4,…n=2,3,4,\ldots the respective maximum degrees Δ(Jn(x))\Delta(J_n(x)) are yielded by the sequence A319433 with closed formula Δ(Jn(x))=⌊2(n+2)1+5⌋−1\Delta(J_n(x))=\left\lfloor\frac{2(n+2)}{1+\sqrt{5}}\right\rfloor-1, n=2,3,4,…n=2,3,4,\ldots

Furthermore, it implies that sequence A319433 is pp-graphical where p(G)=Δ(G)p(G)=\Delta(G) and F={G:G=Jn(x),n=2,3,…}\mathcal{F}=\{G:G=J_n(x),n=2,3,\ldots\}.

The AI-assisted mathematical reasoning included n=1n=1 and it is easy to see why. Since 1<2(1+2)1+5<21<\frac{2(1+2)}{1+\sqrt{5}}<2 it follows that ⌊2(1+2)1+5⌋−1=0\left\lfloor\frac{2(1+2)}{1+\sqrt{5}}\right\rfloor-1=0.

Therefore, the conjecture may be considered for n=1,2,3,…n=1,2,3,\ldots The AI-assisted mathematical reasoning utilized the conventional directed linear Jaco graph with the notation thereof as found in the founding papers. See [4, 5]. Adapting the proof to the notation in [3] is easy in that:

t1(vi)=d−(vi), t2∗(vi)=d+(vi) in J∞(x) andt_1(v_i)=d^{-}(v_i),\ t_2^{*}(v_i)=d^{+}(v_i)\text{ in }J_{\infty}(x)\text{ and}
t2(vi)=d+(vi) in the finite truncation to obtain Jn(x), n∈N.t_2(v_i)=d^{+}(v_i)\text{ in the finite truncation to obtain }J_n(x),\ n\in\mathbb{N}.

Note that for a sufficiently large nn (which always exists), t2∗(vi)=t2(vi)=d+(vi)t_2^{*}(v_i)=t_2(v_i)=d^{+}(v_i).

AI-assisted mathematical reasoning

It is known that the golden ratio is,

φ=1+52\varphi=\frac{1+\sqrt{5}}{2}

The known identities which will be used frequently are,

φ2=φ+1,1φ=φ−1,1φ2=2−φ,1φ+1φ2=1.\varphi^2=\varphi+1,\quad\frac{1}{\varphi}=\varphi-1,\quad\frac{1}{\varphi^2}=2-\varphi,\quad\frac{1}{\varphi}+\frac{1}{\varphi^2}=1.

Note that since φ\varphi is irrational, every nonzero integer multiple of φ\varphi, 1φ\frac{1}{\varphi}, 1φ2\frac{1}{\varphi^2} is irrational. Also, for a given viv_i the largest j>ij>i such that vjv_j is a neighbor of viv_i is called the reach of viv_i and denoted by RiR_i and defined by Ri=2i−t1(vi)R_i=2i-t_1(v_i). It implies that a vertex vjv_j, i<j≤Rii<j\leq R_i is a neighbor of viv_i. Consequently,

t2∗(vi)=Ri−i=i−t1(vi).t_2^{*}(v_i)=R_i-i=i-t_1(v_i).

In a finite linear Jaco graph the degree of a vertex viv_i is bounded by deg⁡(vi)≤i\operatorname{deg}(v_i)\leq i. For use later on the next is an important definition.

Definition 4.1. For i≥1i\geq1, define

Ai=⌊i+1φ2⌋ and Bi=⌊i+1φ⌋.A_i=\left\lfloor\frac{i+1}{\varphi^2}\right\rfloor\text{ and }B_i=\left\lfloor\frac{i+1}{\varphi}\right\rfloor.

Lemma 4.1. For integers i≥1i\geq1 we have Ai+Bi=iA_i+B_i=i.

Proof. Note that both i+1φ2\frac{i+1}{\varphi^2} and i+1φ\frac{i+1}{\varphi} are non-integers. However, from the fourth identity i.e. 1φ+1φ2=1\frac{1}{\varphi}+\frac{1}{\varphi^2}=1 it follows that,

i+1φ2+i+1φ=i+1 and an integer.\frac{i+1}{\varphi^2}+\frac{i+1}{\varphi}=i+1\text{ and an integer.}

Hence, the identity ⌊x⌋+⌊y⌋=x+y−1\lfloor x\rfloor+\lfloor y\rfloor=x+y-1 applies. Therefore,

Ai+Bi=⌊i+1φ2⌋+⌊i+1φ⌋=i+1φ2+i+1φ−1=i.A_i+B_i=\left\lfloor\frac{i+1}{\varphi^2}\right\rfloor+\left\lfloor\frac{i+1}{\varphi}\right\rfloor=\frac{i+1}{\varphi^2}+\frac{i+1}{\varphi}-1=i.

Lemma 4.2. (Reach identity) For every i≥1i\geq1 we have, i+Bi=⌊(i+1)φ⌋−1i+B_i=\lfloor(i+1)\varphi\rfloor-1 and in particular, the sequence i+Bii+B_i is strictly increasing.

Proof. From the second identity i.e. φ=1+iφ\varphi=1+\frac{i}{\varphi} it follows that,

(i+1)φ=i+1+i+1φ.(i+1)\varphi=i+1+\frac{i+1}{\varphi}.

Since i+1i+1 is an integer it follows that,

⌊(i+1)φ⌋=i+1+⌊i+1φ⌋=i+1+Bi.\lfloor(i+1)\varphi\rfloor=i+1+\left\lfloor\frac{i+1}{\varphi}\right\rfloor=i+1+B_i.

This settles the result.

Also, the claim to strict increase follows because 1<φ<21<\varphi<2 hence,

⌊(i+1)φ⌋\lfloor(i+1)\varphi\rfloor

increases by 1 or 2. □

Deriving t1(vi)t_1(v_i) and t2∗(vi)t_2^*(v_i)

The AI-assisted mathematical reasoning included autonomous proofs of two important results.

Theorem 4.3. For every i≥1i\geq1 we have, t1(vi)=Ai=⌊i+1φ2⌋t_1(v_i)=A_i=\left\lfloor\frac{i+1}{\varphi^2}\right\rfloor. Consequently, in J∞(x)J_\infty(x) we have that, t2∗(vi)=Bi=⌊i+1φ⌋t_2^*(v_i)=B_i=\left\lfloor\frac{i+1}{\varphi}\right\rfloor.

Proof. The proof will be by mathematical induction. For i=1i=1, there is no smaller indexed vertex, hence t1(v1)=0t_1(v_1)=0. Also A1=⌊1+1φ2⌋=0A_1=\left\lfloor\frac{1+1}{\varphi^2}\right\rfloor=0. Thus the result holds for i=1i=1. Assume the results holds for all i=1,2,3,…,j−1i=1,2,3,\ldots,j-1, j≥2j\geq2. For each i<ji<j the induction hypothesis read with Lemma 4.1 give

Ri=2i−t1(vi)=2i−Ai=i+(i−Ai)=i+Bi.R_i=2i-t_1(v_i)=2i-A_i=i+(i-A_i)=i+B_i.

By Lemma 4.2, Ri=⌊(i+1)φ⌋−1R_i=\lfloor(i+1)\varphi\rfloor-1. The adjacency rule permits the edge vivjv_iv_j, i<ji<j when Ri≥jR_i\geq j. Since the sequence RiR_i is strictly increasing, there exists a terminal interval m,m+1,m+2,…,j−1m,m+1,m+2,\ldots,j-1 or put differently, a subset of vertices {vm,vm+1,vm+2,…,vj−1}\{v_m,v_{m+1},v_{m+2},\ldots,v_{j-1}\} which permits the edges vivjv_iv_j, i=m,m+1,m+2,…,j−1i=m,m+1,m+2,\ldots,j-1. Furthermore, mm is the smallest integer satisfying Rm≥jR_m\geq j. Also, Rm≥j⟺⌊(m+1)φ⌋≥j+1R_m\geq j\Longleftrightarrow\lfloor(m+1)\varphi\rfloor\geq j+1. Since (m+1)φ(m+1)\varphi is irrational it follows that,

⌊(m+1)φ⌋≥j+1⟺(m+1)φ>j+1.\lfloor(m+1)\varphi\rfloor\geq j+1\Longleftrightarrow(m+1)\varphi>j+1.

Since j+1φ\frac{j+1}{\varphi} is non-integral, the smallest integer strictly greater than j+1φ\frac{j+1}{\varphi} is, m+1>j+1φm+1>\frac{j+1}{\varphi}. Therefore, the largest integer strictly less than j+1φ\frac{j+1}{\varphi} is,

m=⌊j+1φ⌋=Bj.m=\left\lfloor\frac{j+1}{\varphi}\right\rfloor=B_j.

So it follows that the number of vertices viv_i, i<ji<j such that the edges vivjv_iv_j exist is given by,

t1(vj)=j−m=j−Bj.t_1(v_j)=j-m=j-B_j.

By Lemma 4.1 j−Bj=Ajj-B_j=A_j or put differently, t1(vj)=Ajt_1(v_j)=A_j. This settles the induction proof of the first part of the theorem. Finally the fact that t2∗(vi)=i−t1(vi)t_2^*(v_i)=i-t_1(v_i) read together with Lemma 4.1 concludes that t2∗(vi)=i−Ai=Bit_2^*(v_i)=i-A_i=B_i which proves the second part of the theorem. □

Note 4.4. Theorem 4.3 independently confirms what Wagner [4, 6] established i.e. t1(vi)=⌊2(i+1)3+5⌋t_1(v_i)=\left\lfloor\frac{2(i+1)}{3+\sqrt{5}}\right\rfloor because 3+5=2φ23+\sqrt{5}=2\varphi^2.

Deriving degree of vertex viv_i in Jn(x)J_n(x), n∈Nn \in\mathbb{N}, 1≤i≤n1 \le i \le n.

Note that for a given i∈Ni \in\mathbb{N}, t1(vi)t_1(v_i) remains a constant in the family of finite linear Jaco graphs Jn(x)J_n(x), n=1,2,3,…n=1,2,3,\ldots. However, due to truncation to obtain a finite linear Jaco graph Jn(x)J_n(x), n∈Nn \in\mathbb{N} it follows that t2(vi)≤t2∗(vi)t_2(v_i) \le t_2^*(v_i). The next theorem provides a result for deg⁡(vi)\operatorname{deg}(v_i), vi∈V(Jn(x))v_i \in V(J_n(x)), n∈Nn \in\mathbb{N}.

Theorem 4.5. For every n≥1n \ge1 and every 1≤i≤n1 \le i \le n and every vi∈V(Jn(x))v_i \in V(J_n(x)),

deg⁡(vi)=min⁡{i,n−⌊i+1φ⌋}.\operatorname{deg}(v_i)=\min\left\{i,n-\left\lfloor\frac{i+1}{\varphi}\right\rfloor\right\}.

Proof. By Theorem 4.3 the vertex viv_i has t1(vi)=Ait_1(v_i)=A_i and in J∞(x)J_\infty(x) we have t2∗(vi)=Bit_2^*(v_i)=B_i. The neighbors corresponding to t2∗(vi)t_2^*(v_i) are,

vi+1,vi+2,vi+3,…,vi+Bi.v_{i+1},v_{i+2},v_{i+3},\ldots,v_{i+B_i}.

In Jn(x)J_n(x) the neighbors corresponding to t2(vi)t_2(v_i) is limited to a subset of the set {vi+1,vi+2,vi+3,…,vn}\{v_{i+1},v_{i+2},v_{i+3},\ldots,v_n\}. Hence the number (cardinality of permissible subset) of such neighbors is min⁡{Bi,n−i}\min\{B_i,n-i\}. Hence, deg⁡(vi)=Ai+min⁡{Bi,n−i}\operatorname{deg}(v_i)=A_i+\min\{B_i,n-i\}. Using Ai+Bi=iA_i+B_i=i it follows that,

deg⁡(vi)=min⁡{Ai+Bi,Ai+n−i}=min⁡{i,n−(i−Ai)}=min⁡{i,n−Bi}.\begin{aligned} \operatorname{deg}(v_i)&=\min\{A_i+B_i,A_i+n-i\}\\ &=\min\{i,n-(i-A_i)\}\\ &=\min\{i,n-B_i\}. \end{aligned}

By substituting Bi=⌊i+1φ⌋B_i=\left\lfloor\frac{i+1}{\varphi}\right\rfloor the result is settled. □

Note 4.6. No boundary approximation is involved in Theorem 4.5. Truncation removes precisely those neighbors whose indices exceed nn. The indices of the forward neighbors corresponding to t2(vi)t_2(v_i) form a consecutive interval of integers and the number of such integers is exactly min⁡{Bi,n−i}\min\{B_i,n-i\}.

A scalar threshold for Δ(Jn(x))\Delta(J_n(x)).

Define Δn=Δ(Jn(x))\Delta_n=\Delta(J_n(x)). By Theorem 4.5 we have Δn=max⁡1≤i≤n{min⁡{i,n−Bi}}\Delta_n=\max_{1\le i\le n}\{\min\{i,n-B_i\}\}. For i=1,2,3,…i=1,2,3,\ldots the sequence BiB_i is non-decreasing, since it is the floor of a strictly increasing function.

Lemma 4.7. (Threshold characterization) For every n≥2n \ge2 and every integer rr, 1≤r≤n1 \le r \le n,

Δn≥r⟺r+Br≤n.\Delta_n \ge r \Longleftrightarrow r+B_r \le n.

Proof. From Δn=max⁡1≤i≤n{min⁡{i,n−Bi}}\Delta_n = \max_{1 \le i \le n}\{\min\{i,n-B_i\}\} it follows that Δn≥r\Delta_n \ge r if and only if there exists an ii, 1≤i≤n1 \le i \le n such that both i≥ri \ge r and n−Bi≥rn-B_i \ge r. Equivalently, there exists an i∈{r,r+1,r+2,…,n}i \in\{r,r+1,r+2,\ldots,n\} such that Bi≤n−rB_i \le n-r.

Since BiB_i is non-decreasing there exists an index i∈{r,r+1,r+2,…,n}i \in\{r,r+1,r+2,\ldots,n\} satisfying

Bi≤n−r if and only if Br≤n−r.B_i \le n-r \text{ if and only if } B_r \le n-r.

Therefore, Δn≥r\Delta_n \ge r if and only if r+Br≤nr+B_r \le n. □\square

Lemma 4.7 is the decisive simplification in that, graph theoretical maximization is replaced by inversion of the one-variable quantity r+Brr+B_r.

Proof of main conjecture.

Theorem 4.8. (Maximum degree of each Jn(x)J_n(x), n=1,2,3,…n=1,2,3,\ldots) For every integer n≥1n \ge1 we have,

Δ(Jn(x))=⌊n+2φ⌋−1=⌊2(n+2)1+5⌋−1.\Delta(J_n(x))=\left\lfloor\frac{n+2}{\varphi}\right\rfloor-1=\left\lfloor\frac{2(n+2)}{1+\sqrt{5}}\right\rfloor-1.

Proof. Case 1: For n=1n=1 the result is trivial because Δ(J1(x))=0\Delta(J_1(x))=0.

Case 2: For n≥2n \ge2: By Lemma 4.7 for every rr with 1≤r≤n1 \le r \le n it is true that,

Δn≥r⟺r+⌊r+1φ⌋≤n⟺⌊(r+1)φ⌋≤n+1⟺(r+1)φ<n+2⟺r+1<n+2φ.\begin{aligned} \Delta_n \ge r &\Longleftrightarrow r+\left\lfloor\frac{r+1}{\varphi}\right\rfloor\le n \\ &\Longleftrightarrow\left\lfloor(r+1)\varphi\right\rfloor\le n+1 \\ &\Longleftrightarrow(r+1)\varphi< n+2 \\ &\Longleftrightarrow r+1 < \frac{n+2}{\varphi}. \end{aligned}

The number n+2φ\frac{n+2}{\varphi} is irrational hence, the largest integer r+1r+1 below n+2φ\frac{n+2}{\varphi} is ⌊n+2φ⌋\left\lfloor\frac{n+2}{\varphi}\right\rfloor. Consequently, the largest integer rr for which Δn≥r\Delta_n \ge r is r=⌊n+2φ⌋−1r=\left\lfloor\frac{n+2}{\varphi}\right\rfloor-1. Since 1φ=21+5\frac{1}{\varphi}=\frac{2}{1+\sqrt{5}} the result is settled. □\square

Conclusion

Theorem 4.8 essentially proves the Conjecture 2.2 in [3]. It can be said that integer sequence A319433 found in [9] is pp-graphical where p(G)=Δ(G)p(G)=\Delta(G) and F={G:G=Jn(x),n=1,2,3,…}F=\{G:G=J_n(x),n=1,2,3,\ldots\}.

AI disclosure

AI-assisted mathematical reasoning technology was used substantially in the mathematical exploration, development of candidate arguments, intermediate verification, and preparation of the source manuscript. The technology was used within an author-directed problem-solving and verification methodology. All resulting mathematical claims and proofs were subsequently reviewed and validated before human drafting of a final manuscript. The human authors take full responsibility for all mathematical statements, proofs, computations, citations, and conclusions presented herein.

After completion of this captioned topic and others found in [3] the first author became aware of an independent AI-proof of Conjecture 2.2 posted by Shivan Patel on the repository MathDB. Accordingly no claim of priority is made here.

Dedication

This short paper is dedicated to late Mr Fransloo Vorster (nicknamed ”Fifi”) who was the teacher of mathematics of the second author at Bellville High School, Western Cape Province, South Africa. The dedication serves to acknowledge the remarkable way in which Mr Vorster could explain the wonders of High School Mathematics. May his soul rest in peace.

References

  1. [1]J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London, (1976).
  2. [2]F. Harary, Graph Theory, Addison-Wesley, Reading MA, (1969).
  3. [3]J. Kok, Integer sequences with conjectured relation with certain graph parameters of the family of linear Jaco graphs, arXiv:2507.16500 (2025).arxiv.org/abs/2507.16500
  4. [4]J. Kok, S. Naduvath, C. Kalthavappil, G.K. Augustyni and U.M. Augustine, Special issue on: Reflections on Jaco Graphs, Journal of Informatics and Mathematical Sciences, 8(2), (2016).
  5. [5]J. Kok, C. Susanth and S.J. Kalayathankal, A study on linear Jaco graphs, Journal of Informatics and Mathematical Sciences, 7(2), 69–80,(2015).arxiv.org/abs/1506.06538
  6. [6]J. Kok, Research note: Domination of exact deg-centric Jaco graphs, Open Journal of Discrete Applied Mathematics, 8(2), 52–60,(2025).DOI
  7. [8]K.W. Peters, Theoretical and Algorithmic Results on Domination and Connectivity, Ph.D. thesis, Clemson University, Clemson SC, (1986).
  8. [9]N.J.A. Sloane et al., The On-Line Encyclopedia of Integer Sequences, https://oeis.org.
  9. [10]D.B. West, Introduction to graph theory, Prentice Hall of India, New Delhi, (2001).

Paper details

vlnc:W_dr3fqdrm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY-SA 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI-assisted mathematical reasoning technology

View statement
Looking for related papers…
Contents