Title : ( k-Combinations of an unlabelled graph )
Authors: Madjid Mirzavaziri , Mohammad Reza Ebrahimi Vishki , Kamyar Mirzavaziri ,
Full TextAbstract
In this paper we extend the notion of the binomial coefficient n k into a new notion [G]k , where [G] is an unlabelled graph with n vertices and 0 6 k 6 n. We call [G] k as the graph binomial coefficient and a version of the graph binomial expansion is also studied. As an application of this notion, we enumerate the number of ways to color vertices of a path and beads of a necklace.
Keywords
, k-combination, binomial coefficient, binomial expansion, k-combination of an unlabelled graph, graph binomial coefficient, graph binomial expansion.
@article{paperid:1062457,
author = {Mirzavaziri, Madjid and Mohammad Reza Ebrahimi Vishki and Kamyar Mirzavaziri},
title = {k-Combinations of an unlabelled graph},
journal = {Strong Twins of Ordinary Star-Like Self-Contained Graphs},
year = {2015},
volume = {24},
number = {1},
month = {March},
issn = {1584-286X},
pages = {89--95},
numpages = {6},
keywords = {k-combination; binomial coefficient; binomial expansion; k-combination of an unlabelled graph; graph binomial coefficient; graph binomial expansion.},
}
%0 Journal Article
%T k-Combinations of an unlabelled graph
%A Mirzavaziri, Madjid
%A Mohammad Reza Ebrahimi Vishki
%A Kamyar Mirzavaziri
%J Strong Twins of Ordinary Star-Like Self-Contained Graphs
%@ 1584-286X
%D 2015
