Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Hypergraphs --- Hypergraphes

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The authors present an up-to-date account of results from fuzzy graph theory and fuzzy hypergraph theory and give applications of the results. The book should be of interest to research mathematicians and to engineers and computer scientists interested in applications. Some specific application areas presented from fuzzy graph theory are cluster analysis, pattern classfication, database theory, and the problem concerning group structure. Applications of fuzzy hypergraph theory to portfolio management, managerial decision making with an example to waste management, and to neural cell-assemblies are given. It is shown how (fuzzy) hypergraphs and rough sets are related in such a way that ideas may be carried back and forth between the two areas.

Fuzzy graphs. --- Fuzzy hypergraphs.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish strong uniformity results pertaining to zeta functions enumerating conjugacy classes of these groups. We deduce that the numbers of conjugacy classes of Fq-points of the groups under consideration depend polynomially on q. Our approach combines group theory, graph theory, toric geometry, and p-adic integration. Our uniformity results are in line with a conjecture of Higman on the numbers of conjugacy classes of unitriangular matrix groups. Our findings are, however, in stark contrast to related results by Belkale and Brosnan on the numbers of generic symmetric matrices of given rank associated with graphs"--

Graph theory --- Hypergraphs --- Matroids

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Graph theory --- Hypergraphs --- Théorie des graphes --- Hypergraphes

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Aimed at graduate students and researchers, this fascinating text provides a comprehensive study of the Erdős-Ko-Rado Theorem, with a focus on algebraic methods. The authors begin by discussing well-known proofs of the EKR bound for intersecting families. The natural generalization of the EKR Theorem holds for many different objects that have a notion of intersection, and the bulk of this book focuses on algebraic proofs that can be applied to these different objects. The authors introduce tools commonly used in algebraic graph theory and show how these can be used to prove versions of the EKR Theorem. Topics include association schemes, strongly regular graphs, the Johnson scheme, the Hamming scheme and the Grassmann scheme. Readers can expand their understanding at every step with the 170 end-of-chapter exercises. The final chapter discusses in detail 15 open problems, each of which would make an interesting research project.

Intersection theory. --- Hypergraphs. --- Combinatorial analysis. --- Intersection theory (Mathematics)