44
Voted
DM
2008
15 years 23 days ago
2008
109
Voted
DM
2008
15 years 23 days 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...
103
Voted
DM
2008
15 years 23 days 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 ...
82
Voted
DM
2008
15 years 23 days 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...
105
click to vote
DM
2008
15 years 23 days 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...
81
Voted
DM
2008
15 years 23 days 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....
52
Voted
DM
2008
15 years 23 days ago
2008
96
Voted
DM
2008
15 years 23 days 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 ...
49
Voted
DM
2008
15 years 23 days ago
2008
