z-logo
open-access-imgOpen Access
G, G ̅ Properties – from G ̅, G
Author(s) -
A. Elakkiya,
M. Yamuna
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.26654
Subject(s) - matlab , graph , partition (number theory) , chromatic scale , planar graph , computer science , combinatorics , chromatic polynomial , mathematics , planar , discrete mathematics , computer graphics (images) , programming language
In this paper weprovide a method of determining the chromatic polynomial of  without actual construction of . A planar graph characterization of graphs whose domatic partition is  using  properties is established and provide a MATLAB program for identifying just excellent graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here