We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Article:(k,r) - Semi Strong Chromatic Number of a Graph

by G. Jothilakshmi, A. P. Pushpalatha, S.Suganthi, V.Swaminathan
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 21 - Number 2
Year of Publication: 2011
Authors: G. Jothilakshmi, A. P. Pushpalatha, S.Suganthi, V.Swaminathan
10.5120/2486-3354

G. Jothilakshmi, A. P. Pushpalatha, S.Suganthi, V.Swaminathan . Article:(k,r) - Semi Strong Chromatic Number of a Graph. International Journal of Computer Applications. 21, 2 ( May 2011), 7-10. DOI=10.5120/2486-3354

@article{ 10.5120/2486-3354,
author = { G. Jothilakshmi, A. P. Pushpalatha, S.Suganthi, V.Swaminathan },
title = { Article:(k,r) - Semi Strong Chromatic Number of a Graph },
journal = { International Journal of Computer Applications },
issue_date = { May 2011 },
volume = { 21 },
number = { 2 },
month = { May },
year = { 2011 },
issn = { 0975-8887 },
pages = { 7-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume21/number2/2486-3354/ },
doi = { 10.5120/2486-3354 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:07:27.364598+05:30
%A G. Jothilakshmi
%A A. P. Pushpalatha
%A S.Suganthi
%A V.Swaminathan
%T Article:(k,r) - Semi Strong Chromatic Number of a Graph
%J International Journal of Computer Applications
%@ 0975-8887
%V 21
%N 2
%P 7-10
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Let G = (V,E) be a simple, finite, undirected graph. Let k, r be positive integers. A set S V (G). A partition of V(G) is called (k,r) - semi strongly stable set if |Nr (u) S| ≤ k, for all u Є V(G). A partition of V(G) into (k, r) - semi strongly stable sets is called (k, r) - semi strong coloring of G. The minimum order of a (k, r) - semi strong coloring of G is called (k, r) - semi strong chromatic number of G and it is denoted by Xs(k,r)(G). The number Xs(k,r)(G) is determined for various known graphs and some bounds are obtained for it.

References
  1. J. A. Andrews and M. S. Jacobsn, On a generalization of chromatic number, Congr. Numer. 47(1985) 33-48
  2. G. Chartrand, D. Geller and S. Hedetniemi, A generalization of chromatic number, Proc. Cambridge Philos. Soc64(1968) 265-271.
  3. Florica Kramer and Horst Kramer, A survery on the distance-colouring of graphs, presented in the International confrernce Combinatorics’04, Capomulini (Catania, Italy).
  4. F. Harary, Graph Theory (Addison- Wesley, Reading, MA, 1969).
  5. EA Nordhaus, JW Gaddum, On complementary graphs, AM. Math. Monthly 63 (1956) 175-177.
  6. E.Sampthkumar, Generalizations of independence and chromatic numbers of a graph, Discrete Math. 115(1993) 245-251.
  7. E.Sampathkumar amd G.D.Kamath,k-size Chromatic number of a graph,The Indian Journal of statistics, Special Volume 54(1992) 393-397.
  8. E. Sampthkumar and P. S. Neeralagi and C. V. Venkatachalam, A generalization of chromatic and line chromatic number, J. Karnatak Univ, Sci. 22(1977) 44-49.
  9. E. Sampthkumar and C. V. Venkatachalam, Chromatic partitions of a graph, Discrete Math. 74(1989) 227-239.
  10. Timothy J. Bean, Michael A. Henning, Henda C. Swart, On the integrity of distance domination in graphs,Australian Journal of Combinatorics, 10(1994) 29-43.
  11. A. Toft, On critical subgraphs of color-critical graphs, Discrete Math. 7(1974) 377-392.
  12. Doughlas B. West, Intoduction to Graph Theory (Prentice- Hall of India, 2003).
  13. E.Sampathkumar, L. Pushpalatha, Semi strong chromatic number of a grpah, Indian J. Pure appl Math., 26(1) : 35-40, January 1995.
  14. G.Jothilakshmi, A. P. Pushpalatha, S. Sugnathi and V. Swaminathan, (k,r)-coloring, International Journal of Mathematics, Computer Science and Information Technology, Vol. 1, December 2008. pp 211-219.
Index Terms

Computer Science
Information Sciences

Keywords

(k r)-semi strongly stable set (k r)-chromatic number

Powered by PhDFocusTM