Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Venkataraman Yegnanarayanan"'
A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachromatic number of a graph is the greatest number of colors possible used
Externí odkaz:
http://arxiv.org/abs/2408.16739
Publikováno v:
Symmetry, Vol 10, Iss 10, p 468 (2018)
A vertex coloring of a graph G is a mapping that allots colors to the vertices of G. Such a coloring is said to be a proper vertex coloring if two vertices joined by an edge receive different colors. The chromatic number χ ( G ) is the least number
Externí odkaz:
https://doaj.org/article/76fe04228d884418ae31b7a3570fca1c
Publikováno v:
In Expert Systems With Applications 1 June 2024 243
Autor:
Mariappan, Mahesh Babu, Devi, Kanniga, Venkataraman, Yegnanarayanan, Lim, Ming K., Theivendren, Panneerselvam
Publikováno v:
The International Journal of Logistics Management, 2022, Vol. 34, Issue 2, pp. 390-416.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/IJLM-05-2021-0300
Publikováno v:
International Journal of Physical Distribution & Logistics Management, 2022, Vol. 52, Issue 7, pp. 512-537.
Autor:
Venkataraman, Yegnanarayanan1 yegna@klu.ac.in
Publikováno v:
Romanian Journal of Neurology. 2022, Vol. 21 Issue 4, p271-274. 4p.
Autor:
Venkataraman Yegnanarayanan
Publikováno v:
International Journal of Innovative Technology and Exploring Engineering. 9:2075-2081
In the task of structural identification of a network a vital tool is the underlying spectrum associated with the normalized graph Laplacian. To comprehend such spectrum, we need to determine the eigenvalues. In this paper we have found certain usefu
Autor:
Venkataraman Yegnanarayanan
Publikováno v:
International Journal of Innovative Technology and Exploring Engineering. 9:686-690
In the task of coloring the vertices of a simple graph G one come across innumerable number of challenges. There are various graph coloring parameters available in the literature. The concept of pseudo coloring is quite interesting. In this type of c
Publikováno v:
International Journal of Innovative Technology and Exploring Engineering. 9:1665-1669
In this article, we prove that the non-linear Diophantine equation = 2 1 2 … + 1; ≥ 2, ∈ − {2}, ′ are distinct and P is the set of all prime numbers has an infinite number of solutions using the notion of a periodic sequence. Then we also o