AI Chat AI Image Generator AI Video Text to Speech

Total, Equitable Total and Neighborhood sum distinguishing Total Colorings of Some Classes of Circulant Graphs

05/26/2021

∙

by S. Prajnanaswaroopa, et al.

∙

∙

In this paper, we have obtained the total chromatic as well as equitable and neighborhood sum distinguishing total chromatic numbers of some classes of the circulant graphs.

S. Prajnanaswaroopa
1 publication
J. Geetha
1 publication
K Somasundaram
2 publications

page 1

page 2

page 3

page 4

research

∙ 06/13/2020

Total Coloring for some classes of Circulant graphs

The Total coloring conjecture states that any simple graph G with maximu...

0 Prajnanaswaroopa S, et al. ∙

research

∙ 06/13/2020

Total Coloring for some classes of Cayley graphs

The Total coloring conjecture states that any simple graph G with maximu...

0 Prajnanaswaroopa S, et al. ∙

research

∙ 02/23/2022

On discrimination between classes of distribution tails

We propose the test for distinguishing between two classes of distributi...

0 Igor V. Rodionov, et al. ∙

research

∙ 04/15/2018

Edge-sum distinguishing labeling

In this paper we study edge-sum distinguishing labeling, a type of label...

0 Jan Bok, et al. ∙

research

∙ 10/14/2019

Algorithm and hardness results on neighborhood total domination in graphs

A set D⊆ V of a graph G=(V,E) is called a neighborhood total dominating ...

0 Anupriya Jha, et al. ∙

research

∙ 08/10/2021

Distinguishing classes of intersection graphs of homothets or similarities of two convex disks

For smooth convex disks A, i.e., convex compact subsets of the plane wit...

0 Mikkel Abrahamsen, et al. ∙

research

∙ 09/23/2019

A note on the neighbour-distinguishing index of digraphs

In this note, we introduce and study a new version of neighbour-distingu...

0 Eric Sopena, et al. ∙