scientific article

zbMath0682.05001MaRDI QIDQ3995743

Norman L. Biggs

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

partitiondiscrete mathematicsgenerating functionsfinite fieldsgraphsflowsbipartite graphsinteger partitionserror correcting codesintegersmodular arithmeticalgebraic methodsmatching problemsgroups of permutationsefficiency of algorithmsrecursive techniquesclassification and distributiondigraphs, networksfunctions and countinggraphs and algorithmsnumbers and countingprinciples of countingrings, fields and polynomialssubsets and designssymmetry and countingtrees, sorting and searching

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Theory of error-correcting codes and error-detecting codes (94Bxx) Theory of computing (68Qxx) Graph theory (05Cxx) Enumerative combinatorics (05Axx) Elementary number theory (11Axx) Finite fields and commutative rings (number-theoretic aspects) (11Txx) Permutation groups (20Bxx)

Related Items (25)

Central configurations in the spatial \(n\)-body problem for \(n=5,6\) with equal masses ⋮ Graphs, partitions and Fibonacci numbers ⋮ The Fundamental Theorem of Finite Fields: A Proof from First Principles ⋮ New multi-stage secret sharing in the standard model ⋮ An Investigation Into the Cyclically Presented Groups with Length Three Positive Relators ⋮ Generalized polygons and star graphs of cyclic presentations of groups ⋮ Enigma 1225: Prolog-assisted solution of a puzzle using discrete mathematics ⋮ Application of Redfield-Pólya's theorem to the enumeration of the substitution isomers of linear polycyclic aromatic hydrocarbons ⋮ A fully dynamic secret sharing scheme ⋮ Scheduling of a limited communication channel for optimal control. ⋮ Graph-theoretic methods for the analysis of chemical and biochemical networks. II. Oscillations in networks with delays ⋮ A differential equation for a class of discrete lifetime distributions with an application in reliability ⋮ Attacks to some verifiable multi-secret sharing schemes and two improved schemes ⋮ An algorithm forK-convex closure and an application ⋮ Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem ⋮ New efficient and practical verifiable multi-secret sharing schemes ⋮ ENUMERATION OF HOMOGENEOUS COUPLED CELL NETWORKS ⋮ Nonlinear dynamics of networks: the groupoid formalism ⋮ On coloured constant composition designs ⋮ Linear CNF formulas and satisfiability ⋮ Are induction and well-ordering equivalent? ⋮ Reflectiveness and compression of threshold transformations ⋮ The chromatic numbers of graph bundles over cycles ⋮ Dynamic \((t, n)\) threshold quantum secret sharing based on \(d\)-dimensional Bell state ⋮ On the locatic number of graphs

This page was built for publication: