No Detail Found!

On perfect 2-coloring of the bicubic graphs with order up to 12

Author(s)
Somayeh Shafiee Alamoti Department of Mathematics, Islamic Azad University, South Tehran branch, Tehran, Iran.
Mehdi Alaeiyan School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846, Iran
Alireza Gilani Department of Mathematics, Islamic Azad University, South Tehran branch, Tehran, Iran.
Maryam Golriz Department of Mathematics, Islamic Azad University, South Tehran branch, Tehran, Iran.
Abstract
A perfect coloring of a graph G with m color (a perfect mcoloring) is a surjective mapping P : V (G) → {1, 2, . . . , m} such thateach vertex of color i has exactly mij neighbors of color j, for all i, j,where M = (mij )i,j=1,2,...,m is the corresponding matrix. In this paper,we classify perfect 2-colorings of the bicubic graphs with order up to 12. 
Publication Details
Page(s) 17-25
DOI DOI not available
Published Journal: Punjab University Journal of Mathematics, Volume: 52, Issue: 8, Year: 2020

Request the full text from PASTIC

Keywords
vertex perfect coloring, equitable partition., Bicubic graphs
0

Citations

0

Downloads

50

Views