Hamming polynomials and their partial derivatives - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Combinatorics Année : 2007

Hamming polynomials and their partial derivatives

Résumé

Hamming graphs are Cartesian products of complete graphs and partial Hamming graphs are their isometric subgraphs. The Hamming polynomial h(G) of a graph G is introduced as the Hamming subgraphs counting polynomial. Kk -derivates of a partial Hamming graph are also introduced. It is proved that for a partial Hamming graph G, the derivate of its polynomial is the polynomial of its derivate. A couple of combinatorial identities involving the coefficients of the Hamming polynomials of Hamming graphs are also proven.
Fichier non déposé

Dates et versions

hal-00414499 , version 1 (09-09-2009)

Identifiants

  • HAL Id : hal-00414499 , version 1

Citer

Bostjan Bresar, Paul Dorbec, Sandi Klavzar, Michel Mollard. Hamming polynomials and their partial derivatives. European Journal of Combinatorics, 2007, 28 (4), pp.1156-1162. ⟨hal-00414499⟩
171 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More