A binomial identity related to Calkin's (Englisch)
- Neue Suche nach: Zhang, Z.
- Neue Suche nach: Zhang, Z.
In:
DISCRETE MATHEMATICS
;
196
, 1/3
;
287-290
;
1999
-
ISSN:
- Aufsatz (Zeitschrift) / Print
-
Titel:A binomial identity related to Calkin's
-
Beteiligte:Zhang, Z. ( Autor:in )
-
Erschienen in:DISCRETE MATHEMATICS ; 196, 1/3 ; 287-290
-
Verlag:
- Neue Suche nach: ELSEVIER SCIENCE PUBLISHERS
-
Erscheinungsdatum:01.01.1999
-
Format / Umfang:4 pages
-
ISSN:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 510
- Weitere Informationen zu Dewey Decimal Classification
-
Klassifikation:
DDC: 510 -
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis – Band 196, Ausgabe 1/3
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
A variation on a theme of Sylvester - a smoother road to Goellnitz's (Big) theoremAlladi, K. et al. | 1999
- 1
-
A variation on a theme of Sylvester - a smoother road to Göllnitz's (Big) theoremAlladi, Krishnaswami et al. | 1999
- 13
-
Linkages in locally semicomplete digraphs and quasi-transitive digraphsBang-Jensen, Jørgen et al. | 1999
- 29
-
Forbidden subgraphs, hamiltonicity and closure in claw-free graphsBrousek, Jan et al. | 1999
- 51
-
Two path extremal graphs and an application to a Ramsey-type problemByer, Owen D. et al. | 1999
- 65
-
The Terwilliger algebras of bipartite P- and Q-polynomial schemesCaughman IV, John S. et al. | 1999
- 97
-
On the local distinguishing numbers of cyclesCheng, C.T. et al. | 1999
- 109
-
A bound for the game chromatic number of graphsDinski, Thomas et al. | 1999
- 117
-
Optimal ternary formally self-dual codesDougherty, Steven T. et al. | 1999
- 137
-
Erdoes-Ko-Rado-type results over J~q(n, d), H~q(n, d) and their designsFu, T.-S. et al. | 1999
- 137
-
Erdos-Ko-Rado-type results over Jq(n,d),Hq(n,d) and their designsFu, Tung-Shan et al. | 1999
- 153
-
Distance graphs and the T-coloring problemGräf, Albert et al. | 1999
- 167
-
A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicityHu, Zhiquan et al. | 1999
- 177
-
Triangles with restricted degrees of their boundary vertices in plane triangulationsJendrol', Stanislav et al. | 1999
- 197
-
On the degrees of irreducible factors of polynomials over a finite fieldKnopfmacher, Arnold et al. | 1999
- 207
-
On the connectivity of random subsets of projective spacesKordecki, Wojciech et al. | 1999
- 219
-
Rabin numbers of Butterfly networksLiaw, Sheng-Chyang et al. | 1999
- 229
-
Hooked k-extended Skolem sequencesLinek, Václav et al. | 1999
- 239
-
The forbidden subgraph characterization of directed vertex graphsPanda, B.S. et al. | 1999
- 257
-
Some new symmetric designs with l=10 having an automorphism of order 5Pavcevic, Mario-Osvin et al. | 1999
- 257
-
Some new symmetric designs with lambda = 10 having an automorphism of order 5Pavcevic, M.-O. / Spence, E. et al. | 1999
- 267
-
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methodsRodriguez, J. A. / Yebra, J. L. A. et al. | 1999
- 267
-
Bounding the diameter and the mean distance a graph from its eigenvalues: Laplacian versus adjacency matrix methodsRodriguez, J.A. et al. | 1999
- 277
-
Indecomposability of cyclic codesKashiwagi, Y. / Kikumasa, I. et al. | 1999
- 281
-
On F-Hamiltonian graphsYang, Zhenqi et al. | 1999
- 287
-
A binomial identity related to Calkin'sZhang, Z. et al. | 1999
- 291
-
A kind of bionomial identityZhang, Z. et al. | 1999
- 291
-
A kind of binomial identityZhang, Zhizheng et al. | 1999