DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
We first give a bijective proof of Gould's identity in the model of binary words. Then we deduce Rothe's identity from Gould's identity again by a bijection, which a...
DM
2008
13 years 11 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
DM
2008
13 years 11 months ago
2008
A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2...
DM
2008
13 years 11 months ago
2008
We construct an "orbital Tutte polynomial" associated with a dual pair M and M of matrices over a principal ideal domain R and a group G of automorphisms of the row spac...
DM
2008
13 years 11 months ago
2008
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
DM
2008
13 years 11 months ago
2008
