Zobrazeno 1 - 10
of 216
pro vyhledávání: '"Kok, Johan"'
Autor:
Thalavayalil, Timmy Tomy1 timmy.thalavayalil@res.christuniversity.in, Kok, Johan1 johan.kok@christuniversity.in, Naduvath, Sudev1 sudev.nk@christuniversity.in
Publikováno v:
Proyecciones - Journal of Mathematics. Aug2024, Vol. 43 Issue 4, p911-926. 16p.
Autor:
Naduvath, Sudev, Kok, Johan
Publikováno v:
Journal of Mathematical and Computational Science, Vol.10, No:2, 2020, 248-261
The first Zagreb index of a graph $G$ is the sum of squares of the vertex degrees in a graph and the second Zagreb index of $G$ is the sum of products of degrees of adjacent vertices in $G$. The imbalance of an edge in $G$ is the numerical difference
Externí odkaz:
http://arxiv.org/abs/2002.10240
In this paper, we study some graph theoretical properties of two derivative Euler Phi function set-graphs. For the Euler Phi function $\phi(n)$, $n\in \mathbb{N}$, the set $S_\phi(n) =\{i:\gcd(i,n)=1, 1\leq i \leq n\}$ and the vertex set is $\{v_i:i\
Externí odkaz:
http://arxiv.org/abs/1901.11135
Autor:
Mphako-Banda, Eunice, Kok, Johan
In an improper colouring an edge $uv$ for which, $c(u)=c(v)$ is called a \emph{bad edge}. The notion of the \emph{chromatic completion number} of a graph $G$ denoted by $\zeta(G),$ is the maximum number of edges over all chromatic colourings that can
Externí odkaz:
http://arxiv.org/abs/1810.13328
Autor:
Kok, Johan, Naduvath, Sudev
The family of Chithra graphs is a wide ranging family of graphs which includes any graph of size at least one. Chithra graphs serve as a graph theoretical model for genetic engineering techniques or for modelling natural mutation within various biolo
Externí odkaz:
http://arxiv.org/abs/1808.08661
Autor:
Kok, Johan, Naduvath, Sudev
With respect to a proper colouring of a graph $G$, we know that $\delta(G) \leq \chi(G) \leq \Delta(G)+1$. If distinct colours represent distinct technology types to be located at vertices the question arises on how to place at least one of each of $
Externí odkaz:
http://arxiv.org/abs/1807.01915
Autor:
Kok, Johan, Naduvath, Sudev
In this paper, we discuss $J$-colouring of the family of Jahangir graphs. Note that the family of Jahangir graphs is a wide-ranging family of graphs which by a generalised definition includes wheel graphs. We characterise the subset of Jahangir graph
Externí odkaz:
http://arxiv.org/abs/1806.10731
Autor:
Kok, Johan, Naduvath, Sudev
In this paper, we present a foundation study for proper colouring of edge-set graphs. The authors consider that a detailed study of the colouring of edge-set graphs corresponding to the family of paths is best suitable for such foundation study. The
Externí odkaz:
http://arxiv.org/abs/1805.02198
Publikováno v:
Contemporary Studies in Discrete Mathematics, Vol.2, Issue 1, 2018, pp. 13-20
If distinct colours represent distinct technology types that are placed at the vertices of a simple graph in accordance to a minimum proper colouring, a disaster recovery strategy could rely on an answer to the question: "What is the maximum destruct
Externí odkaz:
http://arxiv.org/abs/1803.01505
In this paper we study some properties of Fibonacci-sum set-graphs. The aforesaid graphs are an extension of the notion of Fibonacci-sum graphs to the notion of set-graphs. The colouring of Fibonacci-sum graphs is also discussed. A number of challeng
Externí odkaz:
http://arxiv.org/abs/1802.02452