547 search results - page 102 / 110 » dm 2008 |
DM
2008
13 years 11 months ago
2008
In this paper we present an algorithm to generate all minimal 3-vertex connected spanning subgraphs of an undirected graph with n vertices and m edges in incremental polynomial tim...
DM
2008
13 years 11 months ago
2008
Let be a partition. BG-rank() is defined as an alternating sum of parities of parts of [1]. In [2], Berkovich and Garvan found theta series representations for the t-core generat...
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
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
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...