Abstract
The concept of [r,s,t]-colourings was introduced by A. Kemnitz and M. Marangio in 2007 as follows: Let G = (V(G), E(G)) be a graph with vertex set V(G) and E(G) Given non-negative integers r,s and t, an [r,s,t]-colouring of a graph G = (V(G),E(G)) is a mapping C from V(G) ∪ E(G) to the colour set {0,1,2...,k − 1} such that |c(v i ) − c(v j )| ≥ r for every two adjacent vertices v i , v j , |c(e i ) − c(e j )| ≥ s for every two adjacent edges e i , e j , and |c(v i ) − c(e j )| ≥ t for all pairs of incident vertices and edges, respectively. The [r,s,t]-chromatic number X r,s,t (G) of G is defined to be the mininum k such that G admits an [r,s,t]-colouring. In this paper, we determine the [r,s,t]-chromatic number for join graphs S n + O m
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kemnitz, A., Marangio, M.: [r, s, t]- colorings of graphs. Discrete Mathematics 307, 199–207 (2007)
Dekar, L., Effantin, B., Kheddouci, H.: [r, s, t ]-colorings of trees and bipartite graphs. Discrete Mathematics 310, 260–269 (2010)
Kemnitz, A., Marangio, M., Mihók, P.: [r, s, t]- Chromatic numbers and hereditary properties of graphs. Discrete Mathematics 307, 916–922 (2007)
Xu, C., Ma, X., Hua, S.: [r, s, t ]-coloring of Kn, n. J. Appl. Math. Comput. 31, 45–50 (2009)
Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Heidelberg (2008)
Chartrand, G., Lesniak, L.: Graphs and digraphs. Greg Hubit Bookworks, California (1979)
Yap, H.P.: Total coloring of graphs. LNCS. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Berlin Heidelberg
About this paper
Cite this paper
Mo, M. (2012). [r, s, t] - Colouring of Join Graphs S n + O m . In: Jin, D., Lin, S. (eds) Advances in Electronic Engineering, Communication and Management Vol.2. Lecture Notes in Electrical Engineering, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27296-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-27296-7_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27295-0
Online ISBN: 978-3-642-27296-7
eBook Packages: EngineeringEngineering (R0)