Zobrazeno 1 - 10
of 52
pro vyhledávání: '"J, Vernold Vivin"'
In this research, the exact results on $r$-dynamic coloring of lexicographic product of path with star graph, path with double star graph, path with triple star graph and finally complete graph with path are obtained.
Externí odkaz:
http://arxiv.org/abs/2105.08225
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our proofs are
Externí odkaz:
http://arxiv.org/abs/1705.09357
Publikováno v:
Journal of Taibah University for Science, Vol 14, Iss 1, Pp 168-171 (2020)
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G
Externí odkaz:
https://doaj.org/article/a9660afe5c0b4ba2a79a8b55d91f5b63
Autor:
J. Vernold Vivin, K. Kaliraj
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 4, Iss 2, Pp 206-222 (2016)
The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this paper we obtain interesting results regarding the equitable chromatic number $\chi_{=}$ for the corona graph of a simple graph with a wheel graph $G\circ W_n
Externí odkaz:
https://doaj.org/article/3d3a711714804a2c98a1b3bcc9c4f99e
Publikováno v:
Notes on Number Theory and Discrete Mathematics. 27:191-200
An r-dynamic coloring of a graph G is a proper coloring of G such that every vertex in V(G) has neighbors in at least $\min\{d(v),r\}$ different color classes. The r-dynamic chromatic number of graph G denoted as $\chi_r (G)$, is the least k such tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8cb75ec02400447557030283074e2868
https://doi.org/10.7546/nntdm.2021.27.2.191-200
https://doi.org/10.7546/nntdm.2021.27.2.191-200
Publikováno v:
Journal of Taibah University for Science, Vol 14, Iss 1, Pp 168-171 (2020)
A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0be3ad86d66bcfa8325974d4aa1bdf81
https://doaj.org/article/a9660afe5c0b4ba2a79a8b55d91f5b63
https://doaj.org/article/a9660afe5c0b4ba2a79a8b55d91f5b63
Autor:
Ulagammal, S.1 ulagammal2877@gmail.com, J., Vernold Vivin1 vernoldvivin@yahoo.in
Publikováno v:
Proyecciones - Journal of Mathematics. Dec2019, Vol. 38 Issue 5, p1071-1080. 10p.
Autor:
S. Ulagammal, J. Vernold Vivin
Publikováno v:
Proyecciones (Antofagasta). 38:1071-1080
A star coloring of a graph G is a proper vertex coloring in which every path on four vertices in G is not bicolored. The star chromatic number χs (G) of G is the least number of colors needed to star color G. In this paper, we have generalized the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f574a09cf5484a8e04450cf6ab29316a
https://doi.org/10.22199/issn.0717-6279-2019-05-0069
https://doi.org/10.22199/issn.0717-6279-2019-05-0069
Publikováno v:
Proyecciones (Antofagasta). 41:e5140
An equitable coloring of a graph G is a proper coloring of the vertices of G such that the number of vertices in any two color clases differ by at most one. The equitable chromatic number χ=(G) of a graph G is the minimum number of colors needed for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bfa5ebeb365fbe7faf908e5c338b1d5a
https://doi.org/10.22199/issn.0717-6279-5140
https://doi.org/10.22199/issn.0717-6279-5140
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 49:591-600
An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, deg(v)}, for each v ∈ V (G). The r-dynamic chromatic number of a graph G is the smallest k such that G admits an r-dynamic coloring with k col
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6eed3f0d4a313b28a1b83121562f902b
https://doi.org/10.1007/s13226-018-0288-1
https://doi.org/10.1007/s13226-018-0288-1