TITLE

A characterization of the corona product of a cycle with some graphs based on its f-chromatic index

AUTHOR(S)
Adiwijaya; Salman, A. N. M.; Suprijanto, Djoko; Baskoro, Edy Tri
PUB. DATE
May 2012
SOURCE
AIP Conference Proceedings;5/22/2012, Vol. 1450 Issue 1, p155
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
An f-coloring of graph G(V,E) is a generalized edge-coloring such that every vertex ν in V has at most f(ν) edges colored with a same color. There are many applications of the f-coloring, for instance we can use it in order to solve some scheduling problems and some network design problems. The minimum number of colors needed to f-color G is called an the f-chromatic index of G, denoted by χ′f(G). Any graph G has f-chromatic index equal to Δf(G) or Δf(G)+1, where Δf(G) = maxνƸV{[ceiling_left]d(ν)/f(ν)[ceiling_right]}. G is called in the class-1, denoted by G Ƹ Cf 1, if χ′f(G) = Δf(G); otherwise G is called in the class-2, denoted by G Ƹ Cf 2. In this paper, we show that the corona product of Cn with Sm is in Cf 1. Besides that, we characterize the corona product of Cn with either Wn or Kn based on f-coloring.
ACCESSION #
75526951

 

Related Articles

  • Partial trees in weighted graphs-I. MATHEW, SUNIL // Proyecciones - Journal of Mathematics;2011, Vol. 30 Issue 2, p163 

    This paper generalizes the tree concept in Graph Theory, which plays a crucial role in many areas of science and technology. This paper also characterizes partial trees using the concept of maximum spanning trees.

  • The ErdÅ‘s–Gyárfás problem on generalized Ramsey numbers. Conlon, David; Fox, Jacob; Lee, Choongbum; Sudakov, Benny // Proceedings of the London Mathematical Society;Jan2015, Vol. 110 Issue 1, p1 

    Fix positive integers $p$ and $q$ with $2 \leq q \leq {p \choose 2}$. An edge coloring of the complete graph $K_n$ is said to be a $(p, q)$-coloring if every $K_p$ receives at least $q$ different colors. The function $f(n, p, q)$ is the minimum number of colors that are needed for $K_n$ to have...

  • On Ramsey (3K2,P3)-minimal graphs. Muhshi, Hadi; Baskoro, Edy Tri // AIP Conference Proceedings;5/22/2012, Vol. 1450 Issue 1, p110 

    For any given two graphs G and H, we use the notation F→(G,H) to mean that in any red-blue coloring of the edges of F, the following must hold: F contains either a red subgraph G or a blue subgraph H. A graph F is a Ramsey (G,H)-minimal graph if F→(G,H) but F*↛(G,H) for any...

  • Scanning and Selection Methods Using Solution Boxes of Inequality. Kálovics, Ferenc // Applied Mathematics;Dec2010, Vol. 1 Issue 6, p520 

    Numerical methods often reduce solving a complicated problem to a set of elementary problems. In some previous papers, the author reduced the finding of solution boxes of a system of inequalities, the computation of integral value with error bound, the approximation of global maxima to computing...

  • Acyclic total colorings of planar graphs without l cycles. Sun, Xiang; Wu, Jian // Acta Mathematica Sinica;Jul2011, Vol. 27 Issue 7, p1315 

    proper total coloring of a graph G such that there are at least 4 colors on those vertices and edges incident with a cycle of G, is called acyclic total coloring. The acyclic total chromatic number of G is the least number of colors in an acyclic total coloring of G. In this paper, it is proved...

  • The minimum weight t-composition of an integer. Cardoso, D.; Cerdeira, J. // Journal of Mathematical Sciences;Apr2012, Vol. 182 Issue 2, p210 

    Let p and t, p ≥ t, be positive integers. A t-composition of p is an ordered t-tuple of positive integers summing p. If T = ( s , s , . . . , s) is a t-composition p and W is a p − ( t − 1) × t matrix, then $ W(T) = \sum\limits_{k = 1}^t {{w_{{s_k}k}}} $ is called the...

  • Dynamic proper colorings of a graph. Karpov, D. // Journal of Mathematical Sciences;Dec2011, Vol. 179 Issue 5, p601 

    A subdivision of complete graph K is any graph that can be obtained from K by replacing edges of K by chains of two edges (every such chain adds to the graph a new vertex of degree 2). Let G be a connected graph with maximal vertex degree d, d = 8. We prove that there is a proper dynamic vertex...

  • Chromatic numbers of layered graphs with a bounded maximal clique. Berlov, S. // Journal of Mathematical Sciences;Dec2011, Vol. 179 Issue 5, p579 

    A graph is called n-layered if the set of its vertices is a union of pairwise nonintersecting n-cliques. We estimatechromatic numbers of n-layered graphs without (n + 1)-cliques. Bibliography: 10 titles.

  • ACYCLIC 6-COLOURING OF GRAPHS WITH MAXIMUM DEGREE 5 AND SMALL MAXIMUM AVERAGE DEGREE. FIEDOROWICZ, ANNA // Discussiones Mathematicae: Graph Theory;2013, Vol. 33 Issue 1, p91 

    A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, ..., k} of colours such that adjacent vertices receive distinct colours. Such a k-colouring is called acyclic, if for every two distinct colours i and j, the subgraph induced by all the edges linking a vertex...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics