Special Kinds of Colorable Complements in Graphs

Chaluvapaju, B.; Nandeeshukumar, C.; Chaitra, V.
September 2013
International Journal of Mathematical Combinatorics;Sep2013, Vol. 3, p35
Academic Journal
Let G = (V, E) be a graph and C = {C1,C2, ..., Ck} be a partition of color classes of a vertex set V (G). Then the graph G is a k-colorable complement graph GkC (with respect to C) if for all Ci and Cj, i ≠ j, remove the edges between Ci and Cj, and add the edges which are not in G between Ci and Cj. Similarly, the k(i)-colorable complement graph Gk(i)C of a graph G is obtained by removing the edges in (Ci) and (Cj) and adding the missing edges in them. This paper aims at the study of Special kinds of colorable complements of a graph and its relationship with other graph theoretic parameters are explored.


Related Articles

  • ADJACENT VERTEX DISTINGUISHING EDGE COLORINGS OF THE DIRECT PRODUCT OF A REGULAR GRAPH BY A PATH OR A CYCLE. Frigerio, Laura; Lastaria, Federico; Salvi, Norma Zagaglia // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 3, p547 

    In this paper we investigate the minimum number of colors required for a proper edge coloring of a finite, undirected, regular graph G in which no two adjacent vertices are incident to edges colored with the same set of colors. In particular, we study this parameter in relation to the direct...

  • On periodicity of perfect colorings of the infinite hexagonal and triangular grids. Puzynina, S. // Siberian Mathematical Journal;Jan2011, Vol. 52 Issue 1, p91 

    coloring of vertices of a graph G is called r-perfect, if the color structure of each ball of radius r in G depends only on the color of the center of the ball. The parameters of a perfect coloring are given by the matrix A = ( a), where n is the number of colors and a is the number of vertices...

  • A generalization of chromatic polynomial of a graph subdivision. Cardoso, D.; Silva, M.; Szymański, J. // Journal of Mathematical Sciences;Apr2012, Vol. 182 Issue 2, p246 

    Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of all partitions of a given type. The chromatic polynomial of a graph subdivision is generalized, considering two sets of colors, and a general explicit expression is obtained for this...

  • Equitable Total Coloring of Some Graphs. G., Girija; J., Veninstine Vivik // International Journal of Mathematical Combinatorics;Mar2015, Vol. 1, p107 

    In this paper we determine the equitable total chromatic number Χet for the double star graph K1,n,n and the fan graph Fm,n.

  • CHARACTERIZATION OF SIMPLE ORBIT GRAPHS.  // Acta Mathematica Universitatis Comenianae;2010, Vol. 79 Issue 2, p175 

    No abstract available.

  • On dominator colorings in graphs. ARUMUGAM, S; BAGGA, JAY; CHANDRASEKAR, K // Proceedings of the Indian Academy of Sciences: Mathematical Scie;Nov2012, Vol. 122 Issue 4, p561 

    A dominator coloring of a graph G is a proper coloring of G in which every vertex dominates every vertex of at least one color class. The minimum number of colors required for a dominator coloring of G is called the dominator chromatic number of G and is denoted by χ( G). In this paper we...

  • Algebraic Integers as Chromatic and Domination Roots. Alikhani, Saeid; Hasni, Roslan // International Journal of Combinatorics;2012, p1 

    Let G be a simple graph of order n and λ ∈ N. A mapping f : V (G) → {1, 2, . . . , λ} is called a λ-colouring of G if f(u) # f(v) whenever the vertices u and v are adjacent in G. The number of distinct λ-colourings of G, denoted by P(Gλ), is called the chromatic...

  • Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey. Kano, Mikio; Xueliang Li // Graphs & Combinatorics;Nov2008, Vol. 24 Issue 4, p237 

    Nowadays the term monochromatic and heterochromatic (or rainbow, multicolored) subgraphs of an edge-colored graph appeared frequently in literature, and many results on this topic have been obtained. In this paper, we survey results on this subject. We classify the results into the following...

  • THE b-DOMATIC NUMBER OF A GRAPH. FAVARON, ODILE // Discussiones Mathematicae: Graph Theory;2013, Vol. 33 Issue 4, p747 

    Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such partitions. When independent sets are replaced by...


Read the Article


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

Try another library?
Sign out of this library

Other Topics