The independence polynomial of n-th central graph of dihedral groups

An independent set of a graph is a set of pairwise non-adjacent vertices while the independence number is the maximum cardinality of an independent set in the graph. The independence polynomial of a graph is defined as a polynomial in which the coefficient is the number of the independent set in the...

Full description

Saved in:
Bibliographic Details
Main Authors: Najmuddin, Nabilah, Sarmin, Nor Haniza, Erfanian, Ahmad, Rahmat, Hamisan
Format: Article
Language:English
Published: Penerbit UTM Press 2017
Subjects:
Online Access:http://eprints.utm.my/id/eprint/81280/1/NabilahNajmuddin2017_TheIndependencePolynomialOfNThCentral.pdf
http://eprints.utm.my/id/eprint/81280/
https://mjfas.utm.my/index.php/mjfas/article/view/550/pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Teknologi Malaysia
Language: English