Zobrazeno 1 - 10
of 157
pro vyhledávání: '"Sudev Naduvath"'
Autor:
Javeria Amreen, Sudev Naduvath
Publikováno v:
Baghdad Science Journal, Vol 20, Iss 1 (2023)
The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circu
Externí odkaz:
https://doaj.org/article/a3c287d61a944cd1a9781edc07de8ef7
Autor:
S. Madhumitha, Sudev Naduvath
Publikováno v:
Mathematics, Vol 11, Iss 17, p 3643 (2023)
The study on graphs emerging from different algebraic structures such as groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and graph theory are two mathematical fields that focus on creating and ana
Externí odkaz:
https://doaj.org/article/8aecf5f6c9874a99b3c55f5207ad2668
Autor:
Merlin Ellumkalayil, Sudev Naduvath
Publikováno v:
Theory and Applications of Graphs, Vol 8, Iss 2 (2021)
In a proper vertex colouring of a graph, the vertices are coloured in such a way that no two adjacent vertices receive the same colour, whereas in an improper vertex colouring, adjacent vertices are permitted to receive same colours subjected to some
Externí odkaz:
https://doaj.org/article/6fb2331bcd664f60b2c7dcc6cf1decde
Publikováno v:
Indonesian Journal of Combinatorics, Vol 3, Iss 1, Pp 48-62 (2019)
For a colour cluster C = (C1, C2, C3, …, Cℓ), where Ci is a colour class such that ∣Ci∣ = ri, a positive integer, we investigate two types of simple connected graph structures G1C, G2C which represent graphical embodiments of the colour clust
Externí odkaz:
https://doaj.org/article/578be54b1ae24896a028864cc7f9b5e5
Publikováno v:
Mathematics, Vol 3, Iss 3, Pp 604-614 (2015)
Let \(\mathbb{N}_0\) denote the set of all non-negative integers and \(X\) be any non-empty subset of \(\mathbb{N}_0\). Denote the power set of \(X\) by \(\mathcal{P}(X)\). An integer additive set-labeling (IASL) of a graph \(G\) is an injective func
Externí odkaz:
https://doaj.org/article/50ca49895ed741e2bed84956a50f3929
Autor:
Sudev Naduvath
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 1, Pp 70-84 (2015)
A set-labeling of a graph $G$ is an injective function $f:V(G)\to \mathcal{P}(X)$, where $X$ is a finite set and a set-indexer of $G$ is a set-labeling such that the induced function $f^{\oplus}:E(G)\to \mathcal{P}(X)-\{\emptyset\}$ defined by $f^{\o
Externí odkaz:
https://doaj.org/article/4a3ebaccca554e4fa33ed71d1ac12df8
Autor:
Sudev Naduvath, Germina Augustine
Publikováno v:
Mathematics, Vol 3, Iss 1, Pp 29-39 (2015)
Let \(\mathbb{N}_{0}\) be the set of all non-negative integers and \(\mathcal{P}(\mathbb{N}_{0})\) be its power set. Then, an integer additive set-indexer (IASI) of a given graph \(G\) is defined as an injective function \(f:V(G)\to \mathcal{P}(\math
Externí odkaz:
https://doaj.org/article/d87de22b77434c96ad40f10e849ba0b8
In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph $G$. We report on preliminary results thereof. We also establish a necessary and sufficient conditio
Externí odkaz:
http://arxiv.org/abs/1703.01089
For a colour cluster $\C =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\dots,\mathcal{C}_\ell)$, $\mathcal{C}_i$ is a colour class, and $|\mathcal{C}_i|=r_i \geq 1$, we investigate a simple connected graph structure $G^{\C}$, which represents a graphi
Externí odkaz:
http://arxiv.org/abs/1702.00103
For a colour cluster $\mathbb{C} =(\mathcal{C}_1,\mathcal{C}_2, \mathcal{C}_3,\ldots,\mathcal{C}_\ell)$, where $\mathcal{C}_i$ is a colour class such that $|\mathcal{C}_i|=r_i$, a positive integer, we investigate two types of simple connected graph s
Externí odkaz:
http://arxiv.org/abs/1611.01416